code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#include <unordered_map>
#include <math.h>
using namespace std;
#define _USE_MATH_DEFINES
int a[4][3][10];
int main() {
int b, r, f, v;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> b >> f >>... | #include<iostream>
#include<iomanip>
using namespace std;
int main()
{
int n, a[1000];
double s = 0, p = 1;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> a[i];
p = p * a[i];
}
for(int i = 0; i < n; i++)
{
s = s + p/a[i];
}
cout << setprecision(16) << p / s... | 0 | 45,243,804 |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
int n,t,i,j;
string s;
int c[26],m[26];
cin >> n;
fill(m,m+26,50);
for(i=0;i<n;i++){
cin >> s;
fill(c,c+26,0);
for(j=0;j<s.size();j++)
c[(int)(s[j]-'a')]++;
for(j=0;j<26;j++)
m[j]=min(m[j],c... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
ll mod=1e9+7;
int main() {
string l;
cin >> l;
vector<vector<ll>> dp(l.size(),vector<ll>(2));
dp[0][0]=1;
dp[0][1]=2;
for(ll i=1;i<l.size();i++) {
if(l[i]=='1') {
dp[i][1]=dp[i-1][1]*2%mod;
dp[i][0]=d... | 0 | 14,633,742 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H;... | #include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define vi vector<int>
#define vv vector<vi>
#define pb push_back
#define pi pair<int,int>
#define vp vector<pair<... | 0 | 88,408,272 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n-1)/2 << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
class UnionFindDS{
private:
vector<int> p, sz;
int num;
public:
UnionFindDS(int N){
p.assign(N,0); for (int i = 0; i < N; i++) p[i] = i;
sz.assign(N,1); num = N;
}
int numSets(){ return num; }
int findSet(int i){ return p[i] == i ?... | 0 | 87,759,486 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int n = s.size();
vector<ll> a(n+1,0);
rep(i,n) {
if(s.at(i)=='<') {
a[i+1] = a[i]+1;
}
}
for(int i = n; i > 0; --i) {
if(s.at(i-1)=='>') {
... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 0 | 98,522,902 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
int H,W,M;
cin>>H>>W>>M;
map<int,int> height;
map<int,int> width;
vector<vector<int>> target_h(H);
vector<vector<int>> target_w(W);
int max_h=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
static const int INFTY = (1 << 30);
int K, S;
void func()
{
cin >> K >> S;
int ans(0);
rep(i, 0, K + 1)
{
rep(j, 0, K + 1)
{
if (S - i - ... | 0 | 60,726,261 |
#include <iostream>
using namespace std;
int c;
void search(int last, int s, int n)
{
if(n==0){
if(s==0) c++;
return;
}
if(n==1){
if(last<s&&s<10) c++;
return;
}
--n;
for(int i=last+1; i<10; i++){
search(i, s-i, n);
}
}
int main()
{
ios::sync_with_... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (n); i++)
using ... | 0 | 24,433,875 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int R, G, B, N;
cin >> R >> G >> B >> N;
int b = 0;
int cnt = 0;
for(int r = 0; r <= N; r++){
for(int g = 0; g <= N; g++){
b = N - r*R - g*G;
if(b%B == 0 && b >= 0) cnt++;
}
}
cout << cnt <<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-9;
struct mint {
int n;
m... | 0 | 77,342,415 |
#include <iostream>
using namespace std;
#include <stdio.h>
#include <string.h>
#define M 100
int N,R[M+1],C[M][M],B[M][M];
void compute(){
int i=0,j,k,cost;
memset(C,99,sizeof(C));
for(;i<N;i++)C[i][i]=0;
for(j=1;j<N;j++)
for(i=0;i<N - j; i++ )
for (k = i; k < i + j; k++ ){
cost = C[i][k] + C[k+1][i+j] + ... | #include <stdio.h>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <queue>
#include <set>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <complex>
long long int MOD = 1e9+7;
int main(){
long long int N, K, tmp;
scanf("%lld%lld", &N, &K);
std... | 0 | 249,098 |
#include <vector>
#include <iostream>
using namespace std;
int main()
{
int a, b, c, d,count=0,x=0;
cin >> a >> b >> c >> d;
if (a > d)
{
cout << d;
}
else if ((a + b) >= d)
{
cout << a;
}
else
{
cout << a - (d - (a + b));
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se... | 0 | 17,723,755 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cc... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <sstream>
using namespace std;
int main()
{
vector<string> sv;
for (int i = 1; i <= 9; i++){
for (int j = 1; j <= 9; j++){
stringstream ss;
ss << i << 'x' << j << '=' << i*j << '\n';
string temp = ss.str();
sv.push_bac... | 0 | 62,570,618 |
#include <iostream>
#include <map>
#include <unordered_map>
#include <set>
#include <utility>
#include <stack>
#include <cstdio>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
#include <iterator>
#include <sstream>
#define popcount(x) __builtin_popcount(x)
... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int k = 0;
string s;
cin >> s;
for(int i = 0; i < s.size(); i++)
{
for(int j = i + 1; j < s.size(); j++)
{
if(s[i] == s[j])
k++;
}
}
if(k == 0)
cout <... | 0 | 96,178,277 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int h = 20;
int w = 99;
vector<string> white(h, string(w, '#'));
vector<string> black(h, string(w, '.'));
a--;
b--;
for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define endl '\n'
#define all(x) (x).begin(),(x).end()
const int INF=1000000000+5;
const int N=2e5+5;
const ll oo=1e18+5;
const ll mod=1e9+7;
int root[1000005];
int cntt[1000005];
int main(){
ios::sync_with_stdio(0); ci... | 0 | 41,025,743 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define repeat(i, n) for (int i = 0; (i) < (n); ++(i))
#define repeat_from(i, m, n) for (int i = (m); (i) < (n); ++(i))
using namespace std;
template <class T>
void setmax(T &a, T ... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 27,471,163 |
#include <iostream>
#include <cmath>
using namespace std;
const int maxn = 1000000;
int dp[maxn];
bool ar[maxn];
int main()
{
for(int i = 2;i<=maxn;i++)
{
if(!ar[i])
{
for(int j = 2;j*i<maxn;j++)
ar[i*j] = true;
}
dp[i] = dp[i-1] + !ar[i];
}
int n;
while(cin >> n)
cout << dp[n] <<endl;
return 0;
... | #include<bits/stdc++.h>
typedef long long int lli;
#define vi vector<int>
#define vs vector<string>
#define pb push_back
#define endl "\n"
#define sortin sort(arr.begin(),arr.end())
#define inputArray for(int i{};i<n;i++){cin>>arr[i];}
#define inputArray1 for(int i{};i<m;i++){cin>>arr1[i];}
#define intloop for(int i{};... | 0 | 1,419,833 |
#include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
#define int long long int
#define double long double
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define rep(i,a,b) for (int i = a; i < b; ++i)
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL);
#ifnd... | #include <iostream>
#include <string>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <cmath>
using namespace std;
#define mod 1000000007
#define ten5 100005
#define ten52 200005
#define ten53 300005
#d... | 0 | 52,604,698 |
#include<iostream>
int main()
{
char c;
std::cin >> c;
if( isupper(c) )
{
std::cout << "A";
return 0;
}
std::cout << "a";
return 0;
} | #include <iostream>
#include <math.h>
#include <algorithm>
#include <queue>
#define MAXN 500
#define FL(i,j,k) for(ll i=j;i<k;++i)
using namespace std;
typedef long long int ll;
ll N;
int main(){
cin>>N;
ll n=(sqrt(1+8*N)-1)/2;
ll k=N-n*(n+1)/2;
if(k==0){
FL(i, 0, n)cout<<i+1<<'\n';
}
el... | 0 | 30,037,801 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long L, long long T, vector<long long> X, vector<long long> W){
vector<long long> Y(N);
for(int i = 0 ; i <= N-1 ; i++) {
if (W[i] == 1) Y[i] = (X[i]+T)%L; else Y[i] = (X[i]-T)%L;
if (Y[i] < 0) Y[i] += L;
}
long long sumc = 0;
for(int i... | #include<bits/stdc++.h>
#define prArr(Arr,n) for(int _=0;_<n;_++) cout<<(Arr)[_]<<" ";
using namespace std;
const int INF=(int)0x3f3f3f3f;
const int MOD=(int)1e9+7;
int main()
{
int n,k,idx1,ans=INF;
cin>>n>>k;
vector<int> v(n);
for(int i=0;i<n;i++)
cin>>v[i],
idx1=(v[i]==1?i:idx1);
... | 0 | 91,642,012 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,count=0;
cin>>N;
vector<string> s(N);
for(int i=0; i<N; i++){
cin>>s[i];
sort(s[i].begin(),s[i].end());
}
sort(s.begin(),s.end());
ll huga=0;
for(int i=0; i<N-1; i++){
if(s[i]==s[i+1]){
count=count+huga+1... | #include <iostream>
#include <string>
#include <string.h>
#include <stdio.h>
using namespace std;
int H, W, d;
char HW[501][501];
#define OFFSET (502)
struct ToHW {
int x;
int y;
};
ToHW linkHW[1010][1010];
int main(void)
{
cin >> H >> W >> d;
memset(HW, 0, sizeof(HW));
for (int x = 0; x < 1010; x++) {
for (int ... | 0 | 89,337,732 |
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
int main() {
int n,k;
cin >> n >> k;
vector p(n,0);
for (int i=0; i<n; i++) cin >> p[i];
sort(p.begin(), p.end());
k = min(n,k);
int ans = accumulate(p.begin(), p.begin()+k, 0);
cout << ans << endl;
} | #include<iostream>
using namespace std;
int Selection_sort(int dat[],int size){
int min,count=0;
for(int i=0;i<size;++i){
min=i;
for(int j=i;j<size;++j){
if(dat[j]<dat[min]) min=j;
}
if(min!=i) ++count;
swap(dat[i],dat[min]);
}
return count;
}
int main(... | 0 | 82,052,625 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int s;
cin >> s;
int count=1;
while(s!=1&&s!=2&&s!=4){
count++;
if(s%2) s=3*s+1;
else s/=2;
}
cout << count+3 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll X, Y, Z, K;
vector<ll> A, B, C;
int main() {
cin >> X >> Y >> Z >> K;
A.resize(X);
B.resize(Y);
C.resize(... | 0 | 5,746,600 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int N;
cin >> N;
vector<int> C(N-1), S(N-1), F(N-1);
rep(i, N-1) {
cin >> C[i] >> S[i] ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
struct primegroup{
vector<int> r;
primegroup(int n){
r = vector<int>(1000001, 0);
r[1] = n;
}
void unite(int x){
for(int i=2; i*i<=x; i++){
if(x%i != 0) continue;
... | 0 | 43,236,827 |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 200010;
const int INF = 1e9;
int n;
int f[(1<<26)+10];
char s[N];
int main()
{
scanf("%s", s+1); n = strlen(s+1);
for (int i = 1; i < 1<<26; i ++){
f[i] = INF;
}
int st = 0, lst;
for (int i = 1; i <= n; i ++){
lst = st;
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const double PI = acos(-1.0);
const ll MOD = 1e9 + 7;
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << ": " << x << endl;
#define popcnt __builtin_popcount
int main() {
int N; ... | 0 | 68,044,130 |
#include<iostream>
#include<map>
using namespace std;
int main() {
long long n, m, current, f, s;
map<long long, long long> memo;
memo[0] = 1;
long long sum = 0, ans = 0;
scanf("%lld %lld", &n, &m);
for (long long i=0; i<n; i++) {
scanf("%lld", ¤t);
sum = (sum + current) % m;
memo[sum]++;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
ll k;
cin >> k;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
ll cou = 0;
ll q = 10e8 + 7;
for(int i = 0; i < n - 1; i++){
for(int j = i + 1; j < n; j++){
... | 0 | 53,809,911 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9;
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector <bool> T(N);
while (M--) {
int a;
cin >> a;
T[a - 1] = true;
}
vector <ll> dp(N + 1);
... | 0 | 60,922,111 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
#define MODSIZE 1000000007
int main(){
ll n,t;
int i;
ll a[200006];
ll ans = 0;
scanf("%lld %lld", &n, &t);
for(i = 0;i < n;i++){
scanf("%lld", &a[i]);
}
for(i = 1;i < n;i++){
if((a[i... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 52,057,836 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int n;
cin>>n;
ll a;
cin>>a;
ll res = 0, h = a;
for (int i=1; i<n; i++) {
cin>>a;
if (a > h) h = a;
else res += (h - a);
}
cout << res << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = LLONG_MAX;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll MOD = 1e9+7;
int main(){
ll N, K; cin >> N >> K;
vector<ll> A(N+1);
for(int i = 0; i < N; i++) cin >> A[i];
while(K--){
vector<ll> A_... | 0 | 69,143,734 |
#include<iostream>
using namespace std;
int main(){
int n,m,p,mon,pre,x,sum;
while(cin>>n>>m>>p,n||m||p){
pre=0;
sum=0;
for(int i=0;i<n;i++){
cin>>x;
if(i+1==m)
pre=x;
sum+=x;
}
mon=sum*(100-p);
if(pre==0)
cout<<0<<endl;
else{
mon=mon/pre;
cout<<mon<<endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define vt vector
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
signed main() {
... | 0 | 61,323,585 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000000 + 7;
int main() {
int n, y;
cin >> n >> y;
y /= 1000;
int sen, go, man;
bool flag = false;
for (man = 0; man <= n; man++) {
for (go = 0; go <= n - man; go++) {
se... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
ll mod=1e9+7;
ll inf=1e18;
ll bit[3]={0};
int main() {
fast
ll t;
t=1;... | 0 | 33,424,986 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for(int i=0;i<N;i++){
cin >> H.at(i);
}
int count = 1;
for(int i=1;i<N;i++){
int x=0;
for(int j=0;j<i;j++){
if(H.at(i)<H.at(j)){
x=1;
break;
}
}
if(x==0){
cou... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
using ll = long long;
#define INF 1000000000000000000
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n,m;cin>>n>>m;
vector<pair<int,int>> a(n),b(m);
for(int i=0;i<n;i++)
{
int ia,ib;cin>>ia>>ib;
... | 0 | 88,667,224 |
#include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return re... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll =long long;
using namespace std;
using graph=vector<vector<int>>;
using field=vector<string>;
using p =pair<int,int>;
const ll mod=1000000007;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
int main(){
ll n,Y;
cin>>n>>Y;
... | 0 | 67,524,748 |
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | #include <iostream>
using namespace std;
int main(){
int W , H , x , y , r;
bool in=true;
cin >> W >> H >> x >> y >> r;
if((x+r)>W || (x-r)<0){
in=false;
}
if((y+r)>H || (y-r)<0){
in=false;
}
if(in){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | 0 | 70,712,722 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <string>
#include <cmath>
#include <map>
#include <tuple>
using namespace std;
typedef long long ll;
int H, W, D, Q;
vector<tuple<int, int, int>> A;
vector<ll> cum_mp;
bool compare(tuple<int, int, int> &lhs, tuple<int, int, int> &... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define uniq(x) ((x).erase(unique(all(x)),(x).end()))
#define sz(x) ((int)(x).size())
#... | 0 | 80,747,522 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
vector<pair<int,int>> drink(n);
for(int i=0; i<n; i++){
int a,b;
cin >> a >> b;
pair<int, int> p=make_pair(a,b);
drink.at(i) = p;
}
sort(drink.begin(), drink.end... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed io... | 0 | 3,591,118 |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
return true;
}
return false;
}
template <typename T>
bool chmax(T& x, T y){
if(x < y){
x = y... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 11,320,188 |
#include<iostream>
int main()
{
int x,i=0;
while (1)
{
std::cin >> x;
if (x == 0)
{
break;
}
i += 1;
std::cout << "Case" <<" "<<i<<":"<<" "<< x << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
string s;
cin >> s;
for(int i=0; i<a; i++) {
if(!('0' <= s.at(i) && s.at(i) <= '9')) {
cout << "No" << endl;
return 0;
}
}
if(s.at(a) != '-') {
cout << "No" << endl;
return 0;
}
for(int i=a+1... | 0 | 22,642,139 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#include <cassert>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
using namespace std;
using l... | 0 | 35,259,522 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
double ans=0;
for(int i=0;i<n;i++){
double x;
string s;
cin>>x>>s;
if(s=="BTC") x*=380000;
ans+=x;
}
cout<<ans<<endl;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin... | 0 | 48,121,910 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
int main(){
int D;
cin>>D;
if(D==25)
cout<<"Christmas";
else if(D==24)
cout<<"Christmas Eve";
else if(D==23)
cout<<"Christmas Eve Eve";
else
cout<<"Christmas Eve Eve Eve";
return 0;... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
void init_comb()
{
fact[0] = fact[1] = 1;
... | 0 | 52,622,499 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int k,s;
cin >> k >> s;
int ans = 0;
int z = 0;
REP(x,k+1){
REP(y,k+1){
z = s - x - y;
if(x + y + z == s && z >... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 81,204,728 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,l,s,A = 0;
cin >> N;
for (int i = 0;i < N;i++) {
cin >> l >> s;
A += s - l + 1;
}
cout << A << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
using namespace std; using ll = long long; using ld = long double; ... | 0 | 27,947,124 |
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | 0 | 80,290,488 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
int main(){
ll a,b,c;
char x,y;
cin>>a>>x>>b>>c;
if(b<=04)cout<<"Heisei"<<endl;
else cout<<"TBD"<<endl;
return 0;
} | #include <iostream>
using namespace std;
#define MAX 10005
int main(void) {
int n, q, G[MAX];
cin >> n >> q;
for (int i = 0; i < n; i++) {
G[i] = 0;
}
int group = 1;
while (q--) {
int com, x, y;
cin >> com >> x >> y;
if (com == 0) {
if (G[x] == 0 && G[... | 0 | 69,949,946 |
#define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define MP m... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define vll vector<ll>
#define mll map<ll,ll>
#define MOD 1000000007
#define pll pair<ll,ll>
constexpr ll INF = 1999999999999999997;
#define fastio ios_base:... | 0 | 62,115,013 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const double pi=3.14159265358979323846;
const int inf=2e9;
const ll INF=9e18;
typedef pair<int,int> P;
int main() {
cin.... | #include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<int,int> pii;... | 0 | 56,005,915 |
#include <bits/stdc++.h>
using namespace std;
const int N=300000;
int a[N],n;
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%d",&a[i]);
long long j=0,tmp=0,sum=0,num=0;
for (long long i=1;i<=n;i++)
{
while(j<n&&(tmp^a[j+1])==(sum+a[j+1])) tmp^=a[++j],sum+=a[j];
tmp^=a[i];sum-=a[i];
num+=j-i+1;
... | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){i... | 0 | 6,008,378 |
#include<bits/stdc++.h>
using namespace std;
long long x,t;
int main()
{
cin>>x>>t;
if(x-t<0)
{
cout<<0<<endl;
return 0;
}
cout<<x-t<<endl;
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
const long long INF = 100000000;
long long N, M, R;
cin >> N >> M >> R;
vector<long long>r(R);
for(long long i = 0; i < R; ++i){
cin >> r[i];
--r[i];
}
vector<vector<long long>>adj(N, ve... | 0 | 75,374,247 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll k, n, ans;
cin >> k >> n;
ll arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ans = arr[n-1] - arr[0];
for (int i = 1; i < n; i++) {
ans = min(ans, arr[i-1] + k - arr[i]);
}
cout << ans;
} | #include<iostream>
#include<queue>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define ll long long
#define vi... | 0 | 3,901,293 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
string S;
cin>>S... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template <typename T> using V = vector<T>;
template <typename T> using VV = vector<vector<T>>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#defi... | 0 | 10,920,081 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();... | #include<iostream>
using namespace std;
int main() {
int x, y, z;
cin >> x;
cin >> y;
cin >> z;
int alpha;
if (x < y) {
if (y < z) {
cout << x << " " << y << " " << z << endl;
}
else if (z < x) {
cout << z << " " << x << " " << y << endl;
}
else {
cout << x << " " << z << " " << y << endl;
}
... | 0 | 39,744,398 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::vector<long long> a){
bool nextjump = false;
long long count = 0;
for(long long i = 1; i < N; i++) {
if(nextjump){
nextjump = false;
continue;
}
if(a[i-1] == a[i]) {
count++;
nextjump = true;
}
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
const ll C = 1e9+7;
ll F(ll A, ll B) {
return max(log10(A)+1, log10(B)+1);
}
int main(){
ll N;
cin >> N;
ll min_value = INF;
for(ll i=1; i * i <= N; i++) {
if(N % i == 0) {
ll B ... | 0 | 83,454,661 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
using ll=long long;
using P=pair<int,int>;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl '\n'
#defi... | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
typedef long long ll;
const char nl = '\n' ;
const ll MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int N, M; cin >> N >> M;
int a[N], b[N], c[M], d[M];
for(int i = 0; i < N; i... | 0 | 54,828,075 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll INF = 1e18;
int main() {
ll n;
cin >> n;
ll ans = INF;
for (ll i = 1; i*i <= n; ++i) {
if (n%i == 0) {
ll sum = i + n/i - 2;
... | #include<bits/stdc++.h>
using namespace std;
int gcd(int a, int b){
if(b==0) return a;
return gcd(b, a%b);
}
int main(){
int n; cin >> n;
vector<int> a(100000);
int MIN=1000000000;
for(int i=0; i<n; i++){
cin >> a[i];
if(a[i]<MIN) MIN = a[i];
}
int el = gcd(a[0], a[1]);
... | 0 | 7,509,808 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main() {
int n, a, b, c, x;
while(cin >> n >> a >> b >> c >> x, n||a||b||c||x) {
int y[n];
rep(i, n) cin >> y[i]... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 63,299,741 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define r... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | 0 | 30,223,730 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll i,j;
ll n;
cin >> n;
vector<ll> a(n);
ll mic = 0, zeroc = 0, pluc = 0;
for(i = 0;i < n;++i){
cin >> a.at(i);
if(a.at(i) < 0){
++mic;
}else if(a.at(i) == 0){
++zeroc;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(){
int n;
string s[100005];
map<string, int> mp;
cin >> n;
rep(i,n){
cin >> s[i];
sort(s[i].begin(),s[i].end());
}
sort(s,s+n);
rep(i,n-1){
... | 0 | 96,984,184 |
#include<bits/stdc++.h>
using namespace std;
#define N 1000005
#define ll long long
#define debug(a) cout<<#a<<": ";for(auto i:a)cout<<i<<" ";cout<<endl;
#define trace(a) cout<<#a<<": "<<a<<endl;
int a[N];
int main() {
ios_base::sync_with_stdio(false);cout.tie(0);cin.tie(0);
int i,j,k,l,m,n,t;
cin >> n;
for(int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0; i < (int)(n); i++)
int main(){
int N;
cin >> N;
string S;
cin >> S;
int ans = 0;
rep(pass,1000){
vector<int> password(3);
password.at(0) = pass/100;
password.at(1) = pass/10 ... | 0 | 51,777,358 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int N;
vector<vector<int>> cand;
void DFS(vector<int> a) {
if ((int)a.size() == N) {
int num[4];
num[0] = 0;
num[1] = 0;
num[2] = 0;
num[3] = 0;
for (int i = 0; i < N; i++) {
... | 0 | 32,746,386 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,j,n) for(int i=j;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define P pair<int,int>
#define len(s) (int)s.size()
template<... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | 0 | 770,351 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int mod500 = a % 500;
if (b >= mod500) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define int long long
#define counter(m) for(int i=0;i<m;i++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 ... | 0 | 93,067,635 |
#include<iostream>
#include<vector>
#include<algorithm>
void listen_hills(std::vector<int> &hills);
void echo_top3(const std::vector<int> &hills);
int main()
{
using namespace std;
vector<int> hills;
listen_hills(hills);
sort(hills.begin(),hills.end(),greater<int>());
echo_top3(hills);
return 0;
}
void listen_hil... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define MOD 1000000007
#define INF (1<<30)
#define LINF (1LL<<60)
#def... | 0 | 31,454,766 |
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, K;
cin >> A >> B >> C >> K;
for (int i = 0; i <= K; i++) {
for (int j = 0; j <= K; j++) {
for (int k = 0; k <= K; k++) {
int a = A * (1 << i);
int b = B * (1 << j);
int c = C * (1 << k);
if (i + j + k... | 0 | 27,299,434 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define ll long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_t... | 0 | 71,309,701 |
#include<bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
int ans=0;
int main(){
int n,m;
cin >> n >> m;
vector<int> s(n),t(m);
for(int i=0;i<n;i++) cin >> s[i];
for(int i=0;i<m;i++) cin >> t[i];
vector<vector<int>> dp(n+1,vector<int> (m+1,0));
dp[0][0]=1;
for(int i=0;i<n;i++){
int cnt = 0... | #define MOD_TYPE 1
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
using ll = long long int;
using ld = long... | 0 | 78,228,963 |
#include<stdio.h>
int main(){
int n, r, t;
scanf("%d %d", &n, &r);
t = 100 * (10 - n);
if(n<10){
printf("%d\n", r+t);
}
else{
printf("%d\n", r);
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int H, W, s[100][100], r[100][100];
char c;
cin >> H >> W;
for (int i = 0; i != H; i++)
for (int j = 0; j != W; j++) {
cin >> c;
s[i][j] = (c == '#');
if (!i && !j) r[i][j] = s[i][j];
else {
int p = j ? r[i][j - 1] + (s[i]... | 0 | 29,343,515 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ll n, ans = 0;
cin >> n;
string s[n];
ll ra = 0, lb = 0, ba = 0;
rep(i, n) {
cin >> s[i];
rep(j, s[i].size() - 2) if (s[i][j] == 'A' && s[i][j + 1] == '... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
#define rep2(i,a,b) for (ll i=a;i<b;++i)
const ll MOD=1e9+7;
const ll INF=1e9;
const ll IINF=1e18;
const double EPS=1e-8;
const double pi=acos(-1);
template<class... | 0 | 59,691,059 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
int n, a, b;
int A, B, C, ans;
cin >> n >> a >> b;
A = B = C = 0;
rep(i, n)
{
int x;
cin >> x;
if (x <= a)
A++;
else if (x <= b)
B++;
else
C++;
}
ans = min(A, min(B, C));
cout << ... | #include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <limits>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#if 0
#pragma comment(linker,... | 0 | 94,959,525 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | #include<bits/stdc++.h>
using namespace std;
int main(){
int k;
cin >> k;
long a[k];
for(int i=0;i<k;i++)cin >> a[i];
bool chk = true;
long upper = 2;
long lower = 2;
for(int i=k-1;i>=0;i--){
if(upper%a[i] != 0)upper -= upper%a[i];
if(lower%a[i] != 0)lower += a[i] - (lowe... | 0 | 99,946 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
int main(){
string s,t;
cin >> s >> t;
int res = INF;
rep(i,int(s.size())-int(t.size())+1){
int tmp = 0;
rep(j,int(t.size())){
if(s[i+j]=='?' || s[i+j]==t[j])tmp++;
}
if(tmp==int(t.siz... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int num[200000+100];
map<int,int>sz;
set<int>S;
int calcu(int n,int q)
{
int times=0;
while(n)
{
n/=q;
times++;
}
return times;
}
int my_min(int a,int b)
{
return a<b?a:b;
}
int main()
{
int n;
bool flag=t... | 0 | 94,053,911 |
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll power(ll x, ll y);
#define repp(I, A, B) for(int I = A; I <= B; I++)
#define rep(I, A, B) for(int I = A; I < B; I++)
#define rrep(I, B, A) for(int I = B; I >= A; I--)
#define pb emplace_back
#define ff first
#define ss secon... | 0 | 9,234,679 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,m;cin>>n>>m;
vector<vector<char>> a(n,vector<char>(n)),b(m,vector<char>(m));
rep(i,n)rep(j,n)cin>>a[i][j];
rep(i,m)rep(j,m)cin>>b[i][j];
rep(i,n... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 90,446,579 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define inf LLONG_MAX
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main()
{
ll n, m;
cin >> n >> m;
if (2 *... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<vector<int>> dp(n, vector<int>(3));
int a, b, c;
cin >> a >> b >> c;
dp[0][0] = a; dp[0][1] = b; dp[0][2] = c;
for(int i=0; i+1<n; ++i){
cin >> a >> b >> c;
dp[i+1][0] = max(dp[i][1], dp[i][2]) + a;... | 0 | 5,918,533 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int N;
string s, t;
int main()
{
cin >> N >> s >> t;
int ans = 2 * N;
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
if (s.substr(i, (N - i)) == t.su... | #include<iostream>
using namespace std;
int main()
{
int a[5],c;
for(int i=0 ; i<5 ; i++){
cin >> a[i];
}
for(int i=0 ; i<4 ; i++){
for(int j=i+1 ; j<5 ; j++){
if(a[j]>a[i]){
c=a[j];
a[j]=a[i];
a[i]=c;
}
}
... | 0 | 55,246,808 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
int Mremain= M;
int lower= N/2;
int upper= lower+ 1;
while(Mremain > 0){
if(N==2*(upper- lower) || N==2*(upper- lower- 1)){ upper++; }
cout << lower <<" "<< upper << endl;
lower--; upper++;
Mremain--;
}
} | #include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--... | 0 | 43,612,246 |
# include <iostream>
using namespace std;
int N;
int K;
int A[100005];
int maximum=0;
int factor;
int gcd (int a, int b)
{
if (b==0)
{
return a;
}
else
{
return gcd(b, a%b);
}
}
int main()
{
cin>>N;
cin>>K;
for (int i=1; i<=N; i++)
{
cin>>A[i];
max... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define mp make_pair
#define ff first
#define ss second
#define MAXN 1000005
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll k;
cin>>k;
ll e=k/50;
ll f=k%50;
ll rr... | 0 | 25,181,280 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begi... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#includ... | 0 | 35,080,169 |
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<cctype>
#include<string.h>
#define PI 3.1415926
int main(){
int a, b,c;
double C, S, L, h;
scanf("%d %d %d", &a, &b, &c);
C =c *PI / 180;
S = (a*b*sin(C)) / 2;
L = a + b + sqrt(a*a + b*b - 2 * a*b*cos(C));
h = b*sin(C);
printf("%f\n%f\n%f\n", S, L,... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323846
long N, M;
vector<list<long>> G;
vector<long> visited;
int main(void) {
cin >> N >> M;
G.resize(N+1, list<long>());
for (long i = 0; i < M; i++) {
long a, b; cin >> a >> b;
G.at(a).push_back(b);
G.at(b).p... | 0 | 68,415,608 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
float n; cin>>n; cout<<(n * (n + 1)) / 2;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N=0, Y=0;
int a=-1,b=-1,c=-1;
int i,j,k;
cin >> N >> Y;
for(i=0;i<=N;i++){
for(j=0;j<=(N-i);j++){
for(k=0;k<=(N-(i+j));k++){
if(i*10000+j*5000+k*1000 == Y && i+j+k == N){
a=i;
b=j;
c=k;
break... | 0 | 85,578,383 |
#pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << endl;
return;
}
template <typename First, typename... Rest>
void c... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | 0 | 14,107,348 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int n, idx = 0;
int arr[250];
scanf("%d", &n);
while(n--){
scanf("%d", &arr[idx]);
idx++;
}
for(int i = 1; i <= idx; i++){
printf("node %d: ", i);
printf("key = %d, ", arr[i-1]);
if(i !... | #include<bits/stdc++.h>
using namespace std;
#define fastIO() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
int main()
{
fastIO();
string s;
cin >> s;
for(int i=0; i<s.size(); i++)
{
if(s[i] == '1')
{
s[i]='9';
}
else if(s[i] == '9')
{
s[i] = '1';
}
}
cout << s << end... | 0 | 40,392,660 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main(){
ll A, B, C, D; cin >> A >> B >> C >> D;
if(A+B < C+D) cout << "Right" << endl;
else if(A+B>C+D) cout << "Left" << endl;
else cout << "Balanced" << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#define rz(x) resize(x)
#define asn(x,y) assign(x,y)
#define mem(a,b) memset(... | 0 | 92,697,804 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define all(c) c.begin(), c.end()
#define gmax(x,y) x=max(x,y)
#define gmin(x,y) x=min(x,y)
#define gadd(x,y) x=add(x,y)
#define gmul(x,y) x=mul(x,y)
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
typedef vector<int> vi;
int m... | #include <bits/stdc++.h>
#include <queue>
using namespace std;
int main(){
int K, N;
cin >> K >> N;
priority_queue<int> Aque;
int val;
for(int i=0; i<N; i++){
cin >> val;
Aque.push(val);
}
int max_val = Aque.top();
priority_queue<int> DistanceQue;
while (Aque.size() >... | 0 | 34,992,529 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
int main() {
double L; cin >>L;
cout <<fixed;
cout <<setprecision(12) <<pow(L/3.0,3) <<endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 26,020,305 |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int main () {
long long N; cin >> N;
bool j = false;
long long count = 0;
if (N > 0) {
for (int i = 1; i <= N; ++i) {
if (i == 1 || i == 100 || i == 10000) {
j = true;
} else if (i == 10 || i == 1000) {
j = false;
... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int today(int y, int m, int d){
int day = 0, uruu;
uruu = static_cast<int>((y - 1) / 3);
day += ((y - 1) - uruu) * (20 * 5 + 19 * 5);
day += uruu * 20 * 10;
if((y % 3... | 0 | 11,113,675 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
int c;
int sum = 0;
cin >> a >> b;
c = a;
for (int i= 0; i < b-a+1; i++)
{
if (c/10000 == c-(c/10)*10 && c/1000 - (c/10000)*10 == c/10 - (c/100)*10 )
{
sum += 1;
c++;
continue;
}
else
{
c++;
continue;
}
}
cout << sum ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
template <typename T>
struct edge
{
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : ... | 0 | 86,371,074 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define MOD 998244353
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define t() ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin>>n;
ll a[n];
set<ll>s,s1;
set<ll>:: iterator it;
vector<ll>v,v1;
for(int i=0;i<n;i++)
{
cin>>a[i];
s.insert(a[i]);
}
sort(a,a+n);
ll c=0,ans=0,ans1=0;
if(s.size()==n)... | 0 | 87,580,035 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
string S; cin >>S;
reverse(S.begin(),S.end());
string moji[4]={"dream","dreamer","erase","eraser"};
rep(i,0,4) reverse(moji[i].be... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin(... | 0 | 60,522,649 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vp vector<pair<int, int>>
#define vll vector<long long>
#define inf 1000000100
#define infll 1LL << 50
int main()
{
int n, m;
cin >> n >> m;
set<int> s1;
vi v;
bool solve = 0;
f... | #include <bits/stdc++.h>
using namespace std;
long f(long x,long y){
long a = x,b = y;
while(y != 0){
long c = y;
y = x%y;
x = c;
}
return a*b/x;
}
int main(){
long a,b,x,y;
cin>>a>>b>>x>>y;
long X = b/x - a/x;
if(a%x == 0)X++;
long Y = b/y - a/y;
if(a%y =... | 0 | 22,870,933 |
#include <bits/stdc++.h>
int main(void)
{
int K, S;
std::cin >> K >> S;
int ans = 0;
for (int x = 0; x <= K; x++) {
for (int y = 0; y <= K; y++) {
int z = S - x - y;
if (z >= 0 && z <= K) {
ans++;
}
}
}
std::cout << ans << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 0 | 76,905,550 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { ... | #include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
using namespace std;
void b_greedy_takahashi(void) {
long long a, b, k;
cin >> a >> b >> k;
if (k >= a) {
k -= a;
a = 0;
}
else {
a -= k;
k = 0;
}
if (k > 0) {
b -= k;
if (b < 0) b = 0;
}
c... | 0 | 52,564,755 |
#include<bits/stdc++.h>
using namespace std;int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding cin.tie(0);
#define F first
#define S second
#define mp make_pair
#define ll long long
#define Pi atan(1)*4
#define pb push_back
#define vpr vector<pr>
#define pr pair<int, int>
#define vi std::vector<i... | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | 0 | 44,403,635 |
#include <iostream>
#define ll long long
using namespace std;
int main(){
ll n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >>a[i];
ll max =0;
ll sum =0;
for (int i = 0; i < n-1; ++i)
{
max = (a[i] >max)?a[i]:max;
if(max>a[i+1]){
sum +=(max -a[i+1]);
}
}
cout <<sum ;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define vi vector<int >
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin, (x).rend()
#define ll long l... | 0 | 18,383,139 |
#include <iostream>
using namespace std;
typedef long long ll;
int main(void)
{
int N, A[200005];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll ans = 0;
for (int i = 0; i < N; i++) {
ll d = 0;
if (i > 0) {
if (A[i - 1] >= A[i]) {
d ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define d long double
#define scf(n) scanf("%d",&n)
#define lscf(n) scanf("%lld",&n)
#define dscf(n) scanf("%Lf",&n)
#define pri(n) printf("%d ",(int)n)
#define lpri(n) printf("%lld ",n)
#define dpri(n) printf("%Lf ",n)
#define prin(n) printf("%d\n",(in... | 0 | 89,886,450 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<bool> AC(N+1, false);
vector<int> WA(N+1,0);
int ACnum = 0, WAnum = 0;
for(int i = 0; i < M; i++){
int p;
string S;
cin >> p >> S;
if(AC.at(p) == true)... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace ... | 0 | 77,688,682 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000009;
const long long INF = 1LL << 60;
int main() {
int N;
cin >> N;
Graph G(N);
for (int i = 0;... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 0 | 59,608,007 |
#include <iostream>
using namespace std;
int main() {
int x, y;
while( true ) {
cin >> x >> y;
if( x == 0 && y == 0 ) break;
switch( x > y ) {
case 0: cout << x << " " << y << endl; break;
case 1: cout << y << " " << x << endl; break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
int main() {
long long int n,m;
cin>>n>>m;
long long int arr[n];
long long int brr[m];
for(int i = 0;i<n;i++)
{
cin>>arr[i];
}
for(int i = 0;i<m;i++)
{
cin>>brr[i];
}
long long int dp[n+1][m+1];
for(int i = 0 ;... | 0 | 51,282,557 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string,int>;
const double PI = acos(-1);
ll a,b,c,d;
ll f(ll x){
return x-(x/c + x/d - x/lcm(c,d));
}
int main() {
cin >> a >> b >> c >> d;
cout << f(b) - f(a-1) << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long L;
#define max_(x, y) (((x) > (y)) ? (x) : (y))
#define min_(x, y) (((x) < (y)) ? (x) : (y))
#define ___ ios_base::sync_with_stdio(false);cin.tie(NULL);
#define Mx 200001
#define inf 1e15
const L MOD = 1e9+7;
const double pi = 2 * acos (0.0);
L a1,a2,a3,a,... | 0 | 12,356,680 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
const ll MOD = 1e9 + 7;
int main() {
int a, b, x; cin >> a >> b >> x;
if(a <= x && a + b >= x) cout << "YES" << endl;
else ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
typedef pair<int,int> P;
ll nC2(ll n){
return n*(n-1)/2;
}
int main(){
ios::sync_with_stdio(false);
int n; cin >> n;
vector<int> a(n);
rep(i,n)cin >> a[i];
rep(i,n)a[i]--;
vector<int> ... | 0 | 78,860,697 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[500][500];
const ll LINF = 1e18+5;
int main() {
int n,k;
cin >> n >> k;
int h[500] = {};
for (int i=1;i<=n;i++) cin >> h[i];
for (int i=0;i<=n;i++)
for (int j=0;j<=i;j++)
dp[i][j] = LINF;
dp[0][0] = 0;... | #include <iostream>
#include <string>
using namespace std;
int LP[1005][1005]={};
int main() {
int j,k;
string x,y;
cin >> x >> y;
for(j=1;j<=x.size();j++) LP[j][0] = j;
for(k=1;k<=y.size();k++) LP[0][k] = k;
for(j=1;j<=x.size();j++) {
for(k=1;k<=y.size();k++) {
int m = min(LP[j-1][k]+1, LP[j][k-1... | 0 | 88,989,152 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
using vvl = vector<v... | #include <cstdio>
#include <vector>
using namespace std;
#define MAX_V 10000
typedef int int32_t;
int main(void) {
int v, e;
vector<int> g[MAX_V];
int n_in[MAX_V] = {};
scanf("%d %d", &v, &e);
for (int i = 0; i < e; i++) {
int t, u;
scanf("%d %d", &t, &u);
g[t].push_back(u);
... | 0 | 47,238,597 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.