code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int dp[50];
int solve(int id){
if(dp[id] != -1) return dp[id];
if(id == 1 || id == 0) return dp[id] = 1;
int ret = 0;
return dp[id] = solve(id-1) + solve(id-2);
}
int main(){
memset(dp,-1,sizeof(dp));
int n;
cin >> n;
cout << solve(n) << endl;
} | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 75,986,966 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | #include "bits/stdc++.h"
using namespace std;
void Main() {
int n;
cin >> n;
vector<set<int>> graph(n, set<int>());
for (int i = 0; i < n; ++i) {
int u, k;
cin >> u >> k;
--u;
for (int j = 0; j < k; ++j) {
int v;
cin >> v;
--v;
... | 0 | 74,101,836 |
#include<bits/stdc++.h>
using namespace std;
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define faster() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const long long i... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using intpair=pair<int,int>;
using llpair=pair<ll,ll>;
using intq=queue<int>;
using llq=queue<ll>;
using intvec=vector<int>;
using llvec=vector<ll>;
using llmat=vector<vector<ll>>;
#define PI 3.141592653589793
#define INTINF 1<<30
#define LLINF 1LL<<60
#... | 0 | 1,356,236 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int A,B,K,d,p,t;
cin>>A>>B>>K;
t=A+B;
d=K-A;
if(t<=K)
cout<<"0"<<" "<<"0"<<endl;
else if(d>=0)
{
p=B-d;
cout<<"0"<<" "<<p<<endl;
}
else
cout<<A-K<<" "<<B<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n==0) break;
int p[n];
for(int i=0;i<n;i++) cin >> p[i];
sort(p,p+n);
int dif,ma=10000000;
for(int i=0;i<n-1;i++){
dif=p[i+1]-p[i];
ma=min(dif,ma);
}
cout << ma <<endl;
}
return 0;
} | 0 | 29,494,402 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl... | #include "bits/stdc++.h"
using namespace std;
void Main() {
int H, W;
cin >> H >> W;
vector<vector<string> > C(H, vector<string>(W, ""));
for (int i = 0; i < H; ++i) {
string s;
cin >> s;
for (int j = 0; j < W; ++j) {
C[i][j] = s.substr(j, 1);
}
}
for ... | 0 | 69,095,946 |
using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define infile "../test/sample-1.in"
#define int long long
const int INF=1e18;
const int MOD=1e9+7;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overlo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
vector<string> x(a);
for (int i = 0; i < a; i++) {
cin >> x[i];
}
cin >> b;
vector<string> y(b);
for (int i = 0; i < b; i++) {
cin >> y[i];
}
int count = 0;
vector<int> c(a);
if (a>b) {
for (int i = 0; i < a... | 0 | 11,515,247 |
#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>;
int main(){
string s;
cin >> s;
set<char> values;
rep(i,s.size()){
values.insert(s[i]);
}
if(values.size() == 26)
cout << "None" << endl;
else{
for(char c = 'a' ; c < ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <string>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,... | 0 | 63,521,410 |
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#... | #include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
int X, A, B;
scanf("%d %d %d", &X, &A, &B);
if (B <= A) printf("delicious\n");
else if (B <= A + X) printf("safe\n");
else printf("dangerous\n");
return 0;
} | 0 | 80,528,809 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i=j;i<=k;++i)
typedef long long ll;
char cch;
inline ll rd(){
ll x=0,fl=1;
cch=getchar();
while(cch>'9'||cch<'0'){
if(cch=='-') fl=-1;
cch=getchar();
}
while(cch>='0'&&cch<='9') x=(x<<3)+(x<<1)+cch-'0',cch=getchar();
return x*fl;
}
const ... | #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 | 86,877,415 |
#include<cstdio>
const int N=105;
int n;char s[N],t[N];
inline int ck(int x)
{
for(int i=1;i<=x;++i)
if(s[n-x+i]!=t[i])return 0;
return 1;
}
int main()
{
scanf("%d%s%s",&n,s+1,t+1);
for(int i=n;~i;--i)if(ck(i))
return printf("%d",2*n-i),0;
return 0;
} | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).substr((f),(t)-(f)))
#define ALL(a) (a)... | 0 | 34,041,735 |
#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;
const int N = 1e5 + 500;
int dp[N][2],n;
vector < int > v[N];
int f(int i,int x,int lst){
if(x == 0 && v[i].size() == 1 && i != 1) return 0;
if(v[i].size() == 1 && i != 1) return 1;
if(dp[i][x] != -1) return dp[i][x];
vector < int > v1,... | #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 | 13,920,494 |
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <stack>
#include <complex>
#include <stdlib.h>
#include <stdio.h>
#include <functional>
#include <cfloat>
#include <math.h>
... | #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define eps 1e-10
using namespace std;
char s[maxn];
const ll mod=1000000007;
ll dp[maxn][2];
int main()
{
scanf("%s",s+1); ll len=strlen(s+1),p=1,cnt=0,ans=0,a1=0;
for(int i=1;i<=len;i++) if(s[i]=='1') cnt++;
d... | 0 | 12,195,152 |
#include<iostream>
#include<vector>
#include<string>
#include<map>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long int llint;
int main(){
int N;
cin >> N;
int A[N+1];
for(int i=1;i<=N;i++){
cin >> A[i];
}
int cnt=0;
for(int i=1;i<=N;i++){
if(A[A[i]]==i){
cnt++;
}
}
cnt/=2;
... | #include <bits/stdc++.h>
#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(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
const long long INF = 1LL<<60;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inlin... | 0 | 85,739,092 |
#include <bits/stdc++.h>
#include <iomanip>
#include <algorithm>
#define ll long long
#include <unordered_map>
using namespace std;
int main() {
ll n;
bool blank = 0;
cin >> n;
string S;
vector<ll> A(26, 0), B(26, 0);
for(ll i = 0; i < n; i++) {
cin >> S;
vector<ll> B(26, 0);
if(i == 0) {
... | #include <bits/stdc++.h>
using i64 = long long;
int main() {
int n;
std::cin >> n;
std::vector<std::pair<i64, i64>> v;
for (int i = 0; i < n; i++) {
int x, y;
std::cin >> x >> y;
v.emplace_back(x, y);
}
std::sort(v.begin(), v.end(), [](const auto &lhs, const auto &rhs) {
... | 0 | 79,307,058 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T>
using vec = std::vector<T>;
int main() {
ll N,M;
cin >> N >> M;
if(N>M) swap(N, M);
if(N==1 && M==1){
cout << 1 << endl;
} el... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | 0 | 6,630,667 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) ... | #include<bits/stdc++.h>
using namespace std;
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define rep(i,n) for(int i=0; i<(n); ++i)
#define rep1(i,n) for(int i=1; i<=(n); ++i)
#define Dcout(a) cout << setprecision(20) << a << endl
#define MP make_pair
#define PB push_back
#de... | 0 | 77,520,101 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x,ll y){
if(x%y==0)return y;
return gcd(y,x... | #include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x... | 0 | 282,787 |
#include <iostream>
using namespace std;
int solution(const int& N, const int& K){
if(K == 1) return 0;
if(N == K) return 0;
return (N - K);
}
int main() {
int N, K;
cin >> N >> K;
cout << solution(N, K) << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double ans = 0;
for (int i = 1; i <= N; i++) {
double temp = 1.0 / N;
int now = i;
while (now < K) {
now *= 2;
temp /... | 0 | 3,510,953 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#include <random>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
const ll INF = 1000000000;
c... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end())
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"yes"<<endl;}else cout<<"no"<<endl;
int main(){
int n;
... | 0 | 90,910,454 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll n, a, b, ans[300005];
int main() {
scanf("%lld%lld%lld", &n, &a, &b);
if (a == 1) {
if (b != n) {
printf("-1\n");
return 0;
}
for (int i = n; i >= 1; i--) printf("%d ", i);
return 0;
... | 0 | 50,845,916 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i,n) {
cin >> h[i];
}
int ans, cnt;
ans = cnt = 0;
rep(i,n-1) {
if(h[i] >= h[i+1... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2>... | 0 | 14,465,834 |
#include<iostream>
#define CI cin <<
#define CO cout <<
#define E << endl;
using namespace std;
int main(void) {
int a = 0, b = 0;
cin >> a >> b;
if (a < b) {
cout << "a < b" << endl;
}
if (a > b) {
cout << "a > b" << endl;
}
if (a == b) {
CO "a == b" E
}
} | #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 | 36,429,536 |
#include <bits/stdc++.h>
#include <sstream>
#include <iomanip>
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define nout(ans) cout << (ans) << "\n"
#define sout(ans) cout << (ans) << " "
using namespace std... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | 0 | 59,163,381 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main(){
ll A;
string S,T;
cin >> A >> S >> T;
rep(i,A){
cout << S[i] << T[i];
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> P;
#define REP(i, x, n) for(lint i = x ; i < n ; i++)
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for(lint i = n - 1 ; i >= 0 ; i--)
#define SORT(c) sort((c).begin(), (c).end())
const int IINF = 1e9 + 10;
const lint LLINF ... | 0 | 100,442,346 |
#include<iostream>
#include <list>
#include<stack>
#include<queue>
#include <vector>
#include <set>
#include<algorithm>
#include<math.h>
#include<stdlib.h>
#include<string>
#include <functional>
#include<fstream>
#define FOR(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define REP(i,n) FOR((i),0,(n))
#define LL long long
#def... | #include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define LL long long
const int N = 100000+5;
using namespace std;
int x[N];
int dp[N][50];
int main(){
int n;
scanf("%d",&n);
for(int i=1; i<=n; i++) scanf("%d",&x[i]);
int L,Q;
scanf("%d%d",&L,&Q);
for(int i=1; i<=n ;i++){
int left=i+1,righ... | 0 | 56,107,564 |
#include <iostream>
#include <string>
#include <vector>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
int main(){
string s ; cin >> s ;
ll ans = 1+s.size()*(s.size()-1)/2 ;
vll cnt(26,0) ;
for(int i=0;i<s.size();i++) cnt.at(s.at(i)-'a')++ ;
for(int i=0;i<26;i++) ans -= cnt.at(i)*(cnt.at(i)-... | #include<bits/stdc++.h>
using namespace std;
long long dp[2][10003];
int main()
{
long long n,m,a,b,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz,tz,i,j,k,mx=LLONG_MIN,mn=99999999999;
long long x=0,y=0,cnt=0,res=0,ttl=0,ans=0,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<long long>u,v,w; vector< pair<long lon... | 0 | 36,408,835 |
#include <iostream>
int main(){
int n,temp;
std::cin >> n;
temp = n-2;
std::cout << 180 * temp << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define vt vector
#define db long double
#define int long long
#define pb push_back
#define inf (int)1e20
#define mxn (int)2e5+5
#define pii pair<int,int>
#define pq priority_queue
#d... | 0 | 41,210,746 |
#include <iostream>
#include<algorithm>
#include<string>
#include <cmath>
#include <vector>
#include <map>
#include <cstdio>
#pragma region Macros
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define int long long
#define all(x) (x).begin(),(x).end()
#define swap(a,b) (a += b,b = a - b,a... | #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 << "\n";
return;
}
template <typename First, typename... Rest>
void co(First first, ... | 0 | 49,487,913 |
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 100005
int N;
vector<int> Edge[MAX_N];
int dfs(int pos, int pre)
{
int ret = 0;
for (int i = 0; i < Edge[pos].size(); i++) {
int next = Edge[pos][i];
if(next == pre){
continue;
}
ret ^= (dfs(next, pos) + 1);
}
return ret;
}
int ma... | #include <iostream>
#include <fstream>
#include "bits/stdc++.h"
#define REP(i,x,y) for(int i=(x);i<(y);i++)
#define RREP(i,x,y) for(int i=(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string ... | 0 | 28,426,316 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (... | 0 | 19,649,633 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (int) n; i++)
#define rall(v) v.rbegin(), v.rend()
#define all(v) v.begin(), v.end()
#define PB push_back
#define F first
#define S second
typedef unsigned long long llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> v... | #include<stdio.h>
int main(void)
{
int a[5010]={};
int tr;
int i,j;
int n;
int max;
for(scanf("%d",&n);n;scanf("%d",&n))
{
for(i=0;i<5010;i++)a[i]=0;
max=0x80000000;
for(i=1;i<=n;i++)
{
scanf("%d",&tr);
a[i]=a[i-1]+tr;
}
for(i=0;i<n;i++)
... | 0 | 87,859,356 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
const int INF = 1e9;
const int MOD = 1000000007;
int main() {
ll n,k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
ll k_1,k_2;
if(k%2 ==0){
k_1 = ... | #include <cstdio>
#include <cstring>
int main()
{
unsigned int n;
std::scanf("%u", &n);
int g[n][n];
std::memset(g, 0, sizeof(g));
unsigned int u, k, v;
for (auto i = 0u; i < n; ++i) {
std::scanf("%u %u", &u, &k);
for (auto j = 0u; j < k; ++j) {
std::scanf("%u", &v);
g[u-1][v-1] = 1;
... | 0 | 50,260,795 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = S.at(0)-'0';
int b = S.at(1)-'0';
int c = S.at(2)-'0';
int d = S.at(3)-'0';
if (a+b+c+d==7) printf("%d%c%d%c%d%c%d=7", a,'+',b,'+',c,'+',d);
else if (a+b+c-d==7) printf("%d%c%d%c%d%c%d=7", a,'+',b,'+',c... | #include<bits/stdc++.h>
#include<string>
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define forN(i, n) for(int i = 0; i <n ; ++i)
#define endl "\n"
typedef long long ll;
using namespace std;
const ll INF =... | 0 | 55,412,745 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
int main() {
ll n, m, i, j, k;
string s;
cin >>s;
vector<ll> a(27,0);
for(i=0;i<s.size();i++){
a[s[i]-'a']++;
}
ll ret = s.length();
ret = ret*(ret-1)/2;
for(i=0;i... | 0 | 38,949,568 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 2000000010;
constexpr ll INF= 2000000000000000000;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
typedef pair<int,P> PP;
template<class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define MOD (int)(1e9+7)
#define ceil(x, y) (x%y==0? (x/y) : (x/y+1))
#define FOR(i, N) for(int i = 0; i < N; ++i)
#define FOR1(i, N) for(int i = 1; i <= N; ++i)
#define vi vector <int>
#define pii pair <int, int>
#define pb push_back
#define ... | 0 | 41,400,954 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string S, T;
cin >> S;
cin >> T;
int ans = 0;
rep (i, S.length()) {
if (S[i] != T[i]) ans++;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N; i >= 0; i--)
const ll INF = 1000000007;
#define PI 3.1415926535
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, T b) { if... | 0 | 34,283,430 |
#include <iostream>
#include <algorithm>
using namespace std;
#define int long long
#define MOD 1000000007
signed main() {
int n, m;
cin >> n >> m;
int x[n + 1], y[m + 1];
for (int i = 1; i <= n; i++) {
cin >> x[i];
}
for (int i = 1; i <= m; i++) {
cin >> y[i];
}
int xsum = 0, ysum = 0;
for (i... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 0 | 64,616,784 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<long> A(N);
for (int i =0; i<N; i++) cin >> A.at(i);
bool check = false;
sort(A.begin(),A.end());
for (int i =0; i<N-1; i++) {
if (A.at(i) == A.at(i + 1) ) {
check = true;
break;
}
}
if (check) {
c... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
ll A, B, K;
cin >> A >> B >> K;
if(A > K) {
A = A - K;
} else if(A <= K && K < A + B) {
B = B - (K - A);
... | 0 | 47,583,989 |
#include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()... | #include <bits/stdc++.h>
#define ull uint64_t
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mx5 100005
#define mx6 1000005
#define mod 1000000007
#define nfs ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
ll dp[101][mx5] = {};
... | 0 | 34,424,701 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define MAX 1e18
#define MIN -1e18
#define MOD 1000000007
#define base 139
#define base2 31
#define memz(a) memset(a, 0, sizeof(a))
#define memn(a) memset(a, -1, sizeof(a))
#define in1(a) scanf("%lld", &a)
#define in2(a, b) scanf("%lld%lld", &a, &b)
#def... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | 0 | 16,475,321 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | #include <bits/stdc++.h>
#define int long long
using namespace std;
using Graph = vector<vector<int>>;
signed main(){
int N;
cin >> N;
vector<pair<int, int>> R(N);
for( int i = 0; i < N; i++ ){
int X, Y;
cin >> X >> Y;
R.at(i) = make_pair(X, Y);
}
sort(R.rbegin(), R.rend());
vector<pair<int, i... | 0 | 70,159,161 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
string S, T;
cin >> S >> T;
int m = -1;
rep(i, S.size() - T.size() + 1) {
bool ok = true;
rep(j, T.size()) {
if (S[j + i] != '?' && S[j + i] != T[j]) {
ok =... | #include <bits/stdc++.h>
#define long long long int
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) cin >> h[i];
vector<vector<long>> d(n, vector<long>(n));
long res = LONG_MAX;
if (k == n) {
re... | 0 | 57,283,428 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const long long INF = 1LL << 60;
int n,m;
int main()
{
cin >> n >> m;
cout << n*(n-1)/2+m*(m-1)/2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long Int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int q, h, S, D; cin >> q >> h >> S >> D;
int n; cin >> n;
int Q = 4 * q;
int H = 2 * h;
int L = min(min(Q, H), S);
Int ans;
if (2 * L > D) {
ans = ((... | 0 | 53,842,098 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <list>
#include <numeric>
#include <stack>
#include <queue>
#include <tuple>
#include <bitset>
#include <map>
#include <math.h>
using namespace std;
#define rep(i,n) for(int i = 0; i ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(){
string S;
cin >> S;
int l = 0,r= S.length()-1;
int res = 0;
while(l < r){
if(S[l] == S[r]){
l++;
r--;
}else if(S[l] == 'x'){
res++;
... | 0 | 8,588,088 |
#if 1
#include <bits/stdc++.h>
#else
#include "../../bits/stdc++.h"
#endif
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (b)-1;i >= (a);i--)
#define REP(i,n) FOR(i,0,(n))
#define RREP(i,n) RFOR(i,0,(n))
using namespace std;
typedef pair<int, int> P;
#define pb push_back
#define mp ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> X(N), Y(N);
bool flag = false;
int eo = 0;
for(int i=0; i<N; ++i) {
cin >> X[i] >> Y[i];
if(i == 0) eo = abs((X[0] + Y[0] + 2) % 2);
else if(eo != abs((X[i] + Y[i]) % 2)) flag = true;
... | 0 | 65,310,330 |
#include<iostream>
using namespace std;
int main(void){
int n;
int now=100000;
int i,j;
cin>>n;
for(i=0;i<n;i++){
now*=1.05;
if(now%1000>=1){
now+=1000;
now/=1000;
now*=1000;
}
}
cout<<now<<endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
using namespace std;
int main()
{
int d;
for (; cin >> d;)
{
int s = 0;
int x = d;
for (; x < 600; x += d)
{
s... | 0 | 78,609,297 |
#include<iostream>
#include<queue>
using namespace std;
int main()
{
int N,M;
cin>>N>>M;
priority_queue<int>L;
priority_queue<int,vector<int>,greater<int>>R;
for (size_t i = 0; i < M; i++)
{
int l,r;
cin>>l>>r;
L.push(l);
R.push(r);
}
int ans=0;
for (... | #include <bits/stdc++.h>
#define loop for(;;)
typedef std::vector<long> LI;
template<typename T> void scan1(T& x) { fprintf(stderr, "unknown type\n"); }
template<> void scan1(long& x) { if( scanf("%ld", &x) < 0 ) exit(0); }
template<> void scan1(std::string& x) { if( not ( std::cin >> x ) ) exit(0); }
void scan() {}
te... | 0 | 45,681,834 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define VIEW(x) do {cerr << #x << ": "; for(auto i : x) cerr << ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd ( ll a , ll b)
{
if( b ==0 )
{
return a;
}
return gcd( b, a%b);
}
ll cnt( ll a, ll b , ll c)
{
ll temp1 = a/c;
ll temp2 = b/c;
ll ans = temp1 - temp2;
if( b% c ==0)
ans++;
return ans;
}
int mai... | 0 | 36,685,972 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,k,d,a,count[101],sum=0;
cin >> n >> k;
for(int i=0;i<n;i++){
count[i]=0;
}
for(int i=0;i<k;i++){
cin >> d;
for(int j=0;j<d;j++){
cin >> a;
count[a-1]++;
}
}
for(int i=0;i<n... | 0 | 62,086,968 |
#include <bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
int N;
cin >> N;
vector<int> a(N);
REP(i, N){
cin >> a[i];
}
int flashed = 1;
int num = 0;
REP(i, N){
flashed = a[flashed - 1];
num++;
if(flashed == 2){
cout << num << endl;
return 0;
}
}
cout... | #include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
template <class T, class U> ostream &operator<<(ostream &os,... | 0 | 98,033,886 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <queue>
#include <sstream>
#include <stack>
#include <time.h>
#include <vector>
#include <complex>
#include <map>
#include <set>
#include <iomanip>
#include <ma... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#define rep(i, s, g) for (... | 0 | 87,344,410 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
typedef pair<string,ll> si;
typedef pair<ii,ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
#define sort(a) sort(a.begin(),a.end());
#define pb push_back
#define pf push_... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> x(n);
vector<int> sum(102);
for(int i = 0; i < n; i++){
cin >> x[i];
}
for(int p = 0; p <= 101; p++){
for(int i = 0; i < n; i++){
sum[p] += ((x... | 0 | 64,340,635 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
const int mod=1e9+7;
int6... | #include <bits/stdc++.h>
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MOD=1e9+7;
static const ll MAX=101010... | 0 | 82,870,610 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef long int li;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef pair<ll, ll>P;
typedef tuple<ll,int,int,int,int,int,int,int>T;
#define PI 3.14159265358979
const int MAX = 510000;
const int MOD = 1000000007;
long ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 0 | 65,385,991 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define NMAX 10
ll n, m;
ll rec[NMAX][1<<NMAX];
vector<vector<ll>> G;
void init() {
rep(i, 0, NMAX) {
rep(j, 0, 1<<NMAX) rec[i][j] = -1;
}
}
ll dfs(ll cur, ll... | 0 | 97,538,635 |
#include <bits/stdc++.h>
#define rep(i, z, n) for(int i = z; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main(){
int N;
cin >> N;
vector<int> a(N), b(N), c(N), d(N);
vector<pair<int, int>> p_r(N), p_b(N);
rep(i, 0, N){
cin >> a.at(i) >> b.at(i... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
while(cin>>n, n) {
vector<int> a(n);
for (int i = 0; i < n; ++i) {
int tmp;
cin>>tmp;
a[i] = tmp;
}
... | 0 | 94,823,842 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main(){
string s;
cin >> s;
int n = s.size()+1;
vector<int> from_left(n),from_right(n);
rep(i,n-1){
if(s.at(i) == '>') from_left.at(i+1) = 0;
else from_left.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >>x;
int kazu=x/100;
int amari=x%100;
for(int i=0;i<=kazu;i++){
for(int j=0;j<=kazu;j++){
for(int k=0;k<=kazu;k++){
for(int m=0;m<=kazu;m++){
for(int n=0;n<=kazu;n++){
if(i+j*2+k*3+m*4+n*5==amari&&i+j... | 0 | 68,734,029 |
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <set>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
vector<long long int> a(5);
long long int high=10000000;
long long int pre=0;
for(l... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 65,955,078 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n;
cin>>n;
long double ans=0;
for(ll i=0;i<n;i++){
long double now;
cin>>now;
now=1.0/now;
ans+=now;
}
ans=1.0/ans;
cout <<ans;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 0 | 17,085,547 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typ... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#inc... | 0 | 75,801,384 |
#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(){
int n;
int i,j,k,l;
char s[56][56];
int cnt[56][28];
int out[28];
scanf("%d", &n);
for(i = 0;i < n;i++) scanf("%s", s[i]);
for(i = 0;i <= 26;i++){
o... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repit(it, li) for(auto it=li.begin(); it!=li.end(); it++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int gcd(int a, int b) {
if(a<b) swap(a, b);
return b?gcd(b,a%b):a;
}
int lcm(int a, int b) {
ll ret=(ll)a... | 0 | 51,276,899 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,n,i,d=0,e;
cin>>a>>b>>c;
cin>>n;
for(i=1;i<=n;i++){
if(b>a){
d=1;
}
if(d==0 && b<=a){
b*=2;
}
if(d==1 && c<=b){
c*=2;
}
}
if(c>b && b>a){
... | #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-10;
int ii() { int x; if (sca... | 0 | 60,988,846 |
#include <iostream>
#include <stack>
int main(){
std::stack<int> train;
int buf;
while(std::cin >> buf){
if(buf == 0){
std::cout << train.top() << std::endl;
train.pop();
}else{
train.push(buf);
}
}
return 0;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int N, A, B, C;
vector<int> l;
int dfs(int a, int b, int c, int now){
if(now==N){
if(a==0||b==0||c==0) return 1000000000;
return abs(A-a)+abs(B-b)+abs(C-c);
}
int r1=dfs(a, b, c, now+1);
int r2=dfs(... | 0 | 55,913,546 |
#include <iostream>
int main() {
char c; std::cin >> c;
++c;
std::cout << (char)c << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N=5e5+5,mod=1e9+7;
#define ll long long
int a[N];
pair<int,int> Best[N];
void update(pair<int,int> &p,int idx)
{
if(a[idx]>a[p.first]) swap(idx,p.first);
if(a[idx]>a[p.second]&&idx!=p.first) swap(idx,p.second);
}
int main()
{
ios_base::sync_with_stdio(... | 0 | 39,552,903 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const ll MAX = 1e18;
int ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<long long int>
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vb vector<bool>
#define vvl vector<vector<ll> >
#define vvi vector<vector<int> >
#d... | 0 | 80,273,937 |
#include<stdio.h>
int main() {
int a, b, c;
int i;
int cnt = 0;
scanf("%d %d %d", &a, &b, &c);
if (a > b)return -1;
for (i = a; i <= b; i++) {
!(c % i) ? cnt++ :0 ;
}
printf("%d\n", cnt);
return 0;
} | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<l... | 0 | 21,717,782 |
# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <numeric>
# include... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll n;
ll t[100005],x[100005],y[100005];
int main(void){
cin>>n;
t[0]=0; x[0]=0; y[0]=0;
for(int i=1;i<=n;i++){
cin>>t[i]>>x[i]>>y[i];
if(t[i]-t[i-1]<(abs(x[i]-x[i-1])+abs(y[i]-y[i-1]))||(x[i]+y[i])%2!=... | 0 | 82,143,293 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> n(3);
cin >> n[0] >> n[1] >> n[2];
sort(n.begin(), n.end(), greater<int>());
cout << n[0] * 10 + n[1] + n[2];
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define MOD 1000000007
#define oo 1000000000000000000
#define forr(i,n) for(ll i=0;i<n;i++)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0) ; cout.tie(0);
#define all(x) x.begin()... | 0 | 98,379,192 |
#include <bits/stdc++.h>
#define Maxn 507
#define inf 100007
using namespace std;
int n,p;
char s[Maxn];
int f[Maxn][30];
int main()
{
scanf("%s",s+1);
scanf("%d",&p);
n=strlen(s+1);
for (int i=n+1;i<=3*n;i++)
s[i]=s[i-n];
for (int i=1;i<=3*n;i++)
for (int j=1;j<=26;j++)
... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#include <random>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
const ll INF = 1000000000;
c... | 0 | 44,551,232 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int s=0;
int x=n;
while(x>0){
s+=x%10;
x/=10;
}
cout<<(n%s==0?"Yes":"No")<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define MOD ((int)(1e9) + 7)
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define filename "lynext"
#define freop freopen(filename ".cik","w",stdout);freopen(filename ".gir","r",stdin)
const long long int N =... | 0 | 36,178,026 |
#include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,n1,n2) for(int i=n1;i<n2;i++)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
typedef long long int ll;
typedef pair<ll,l... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <string>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <functional>
#include <map>
#include <set>
#include <stack>
#include <deque>
#include <queue>
#include <cstring>
#define MOD 1000000007;
#define LIMIT 1000000000... | 0 | 94,538,686 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1LL << 30;
int MOD = 1e9+7;
main(){
int a;
stack<int> s;
while(cin >> a){
if(a)s.push(a);
else{
cout << s.top() << endl;
s.pop();
}
}
} | #include <iostream>
#include <vector>
#include<list>
#include <algorithm>
#include <string>
#include <math.h>
#include<map>
#include <utility>
#include<queue>
using namespace std;
#define REP(i,k,n) for(int i=k;i<n;i++)
#define INF 1844674407370955161
typedef long long unsigned int ll;
#define SIZE_OF_ARRAY(array) (siz... | 0 | 765,473 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, K; cin >> N >> K;
if(K==1){ cout << "0\n"; }else{ cout << N-K << "\n"; }
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 0 | 17,048,417 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld= long double;
using ull= unsigned long long;
#define endl "\n"
const ll maxn=3e5+100;
const ll maxx=1e13;
const ll mod=1000000007;
map<ll,ll> mp;
ll f[maxn];
ll a[maxn];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cou... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
int n;cin >>n;
int a,b;cin>>a>>b;
int fi=0,se=0,th=0;
vector<int>p(n);
... | 0 | 88,196,741 |
#include<bits/stdc++.h>
using namespace std;
#define fo(i,a,n) for(i=a;i<n;i++)
#define ll long long
#define ld long double
#define deb(x) cout << #x << "=" << x << endl
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K; cin >> N >> K;
vector<long long i... | 0 | 96,508,867 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int main() {
int a, b;
cin >> a >> b;
cout << 6 - a - b;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG_OUTPUT
#define DEBUG_LOG(s) cout << s << endl;
#else
#define DEBUG_LOG(s) void();
#endif
class UnionFindTree {
private:
vector<int> parent;
public:
UnionFindTree(int n) : parent(n) {
for(int i = 0; i < n; i++) parent[i] = i;
}
int... | 0 | 25,768,057 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
int sum = 0;
for (int i = 0; i < N; ++i) {
cin >> a[i];
sum += a[i];
}
int mini = sum;
int prefix_sum = 0;
for (int i = 0; i < N; ++i) {
prefix_sum += a[i];
mini = min(mini, abs(prefix_sum - (sum - prefix_sum)... | #include<algorithm>
#include<bitset>
#include<cassert>
#include<cfloat>
#include<climits>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<array>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>... | 0 | 78,873,310 |
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define F first
#define S second
#define MP make_pair
#define all(x) x.begin(), x.end()
#define watch(x) cout<<#x<<" : "<<x<<endl
#define tr(container, it) for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define testCa... | #include <iostream>
#include <vector>
#include <set>
#include <deque>
#include <map>
#include <iomanip>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <utility>
using namespace std;
int ky[8] = {-1,1,-2,2,-2,2,-1,1};
int kx[8] = {-2,-2,-1,-1,1,1,2,2};
int dy[4] = {-... | 0 | 75,606,351 |
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <utility>
using namespace std;
typedef struct {
char mark;
int num;
} TRUMP;
void bubbleSort(TRUMP a[], int n);
void selectionSort(TRUMP a[], int n);
void dispTrumpList(const TRUMP trump[], int n);
bool isStable(const TRUMP t1[], const TRUMP t2[], in... | #include <bits/stdc++.h>
#include<chrono>
#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
using namespace std;
using namespace chrono;
const ll mod = 1000000007;
const ll N = 300... | 0 | 87,028,768 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
string padd6(string s)
{
if (s=="0")
while(1);
while (s.length() != 6)
s = "0" + s;
return s;
}
signed main()
{
int n,m;
cin >> n >> m;
vector<pair<int,int>> v;
vector<pair<int,int>> vv;
for (int i = 0;i < m;i++)
... | #include<iostream>
#include<queue>
#include<limits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<math.h>
#include<iomanip>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#define ll long long
#define tc(t) wh... | 0 | 81,682,909 |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector <int> n;
int main(){
int k,n,af,al,a1,ans=0;
cin>>k>>n;
cin>>af;
a1=af;
for(int i=0;i<n-1;i++){
cin>>al;
ans=max(ans,al-af);
af=al;
}
ans=max(ans,k-al+a1);
cout<<k-ans<<endl;
return 0;
} | 0 | 73,076,295 |
#include <iostream>
#include <string>
#include <cstdlib>
using namespace std;
int main() {
string S;
cin >> S;
int min = 99999;
int res = 0;
int x = 0;
for(int i = 0; i < S.length() - 2; i++) {
x = 100 * (S[i] - '0') + 10 * (S[i + 1] - '0') + (S[i + 2] - '0');
if(min > abs(x - 753)) {
min = ab... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<string.h>
#include<time.h>
#include<random>
#include<cmath>
#include<math.h>
#include<queue>
#include<time.h>
#include<iomanip>
#include<utility>
#define rt "\n"
#define rep(i,n) for(int i=0;i<n;i++)
#defin... | 0 | 11,034,817 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <random>
#include <tuple>... | 0 | 78,576,213 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int n,q;
vector<int>G[201010];
void dfs(int v,int p,vector<long long> &a){
if(p!=-1)a[v]+=a[p];
rep(i,G[v].size()){
int e=G[v][i];
if(e==p)continue;
dfs(e,v,a);
}
}
int main(){
cin>>n>>q;
rep(i,n-1){... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 0 | 4,207,674 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
int main() {
ll n;
cin >> n;
int m, p;
ll ans = 0;
m = 1e6;
rep(i, n) {
cin >> p;
if (m >= p) {
ans++;
}
m = min(m, p);
}
cout << ans <... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n+1];
for(int i=0;i<=n;i++)cin>>a[i];
long long b[n+1],wa[n+1];
b[0]=1-a[0];
if(b[0]<0){
cout<<"-1"<<endl;
return 0;
}
wa[0]=a[0];
for(int i=1;i<=n;i++)wa[i]=wa[i-1]+a[i];
for(int i=... | 0 | 13,163,610 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int getResult(const vector<int> &points, const int questions,
const int borderA, const int borderB){
int i = 0;
int lowerBorderA = 0;
for(; (i < questions) && (points[i] <= borderA); i++){
lowerBorderA++;
}
int b... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int a,b,k,i=0,j,c=0,p,h[1000010];
cin >> a >> b >> k;
for(i=max(a,b);i>0;i--)
{
if(a%i==0 && b%i==0)
{
c++;
}
if(c==k)
{
cout << i << endl;
return 0;
... | 0 | 78,437,687 |
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <stack>
#include <complex>
#include <stdlib.h>
#include <stdio.h>
#include <functional>
#include <cfloat>
#include <math.h>
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) ... | 0 | 66,252,035 |
#include <bits/stdc++.h>
#define maxn 5001
#define pb push_back
using namespace std;
typedef long long LL;
LL ans,tot;
int n,m,k;
int p[maxn];
int c[maxn];
bool mark[maxn];
vector<int> v;
vector<LL> sum;
void dfs(int u) {
v.pb(u);
tot += c[u];
mark[u] = true;
if(!mark[p[u]])
dfs(p[u]);
}
LL f(int d) {
LL best = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | 0 | 67,865,535 |
#include <cstdio>
#include <vector>
const int MN = 100005;
int N;
std::vector<int> G[MN];
int Ans, siz[MN];
void DFS(int u, int p) {
siz[u] = 1;
int s = 0;
for (int v : G[u]) if (v != p) {
DFS(v, u);
s += siz[v];
siz[u] ^= siz[v];
}
if (s >= 2) Ans = 1;
}
int main() {
scanf("%d", &N);
if (N & 1) return pu... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod ... | 0 | 56,273,800 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e18;
int main() {
int n;
cin >> n;
vector<ll> a(n), aa(n);
unordered_map<ll, ll> mp;
rep(i, n) cin >> a[i], a[i] -= i + 1;
sort(a.begin(), a.end());
ll b = a[n / 2];
ll ans... | #include "bits/stdc++.h"
#define ll long long
#define ull unsigned long long
#define ld long double
#define tiii tuple < int, int, int >
#define pii pair < int, int >
#define pll pair < ll, ll >
#define pci pair < char, int >
#define psi pair < string, int >
#define pis pair < int, string >
#define vi vector < int >
#d... | 0 | 8,294,056 |
#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
const int N = 1e5+5;
int n, m, v, p, a[N], ans; i64 s[N];
int main()
{
scanf("%d%d%d%d", &n, &m, &v, &p), ans = p;
for(int i = 1; i <= n; ++i) scanf("%d", a+i);
sort(a+1, a+1+n, greater<int>());
for(int i = 1; i <= n; ++i) s[i] = s[i-1... | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main()
{
string o, e;
cin >> o;
cin >> e;
string ans;
rep(i, e.size()) {
ans.p... | 0 | 39,617,356 |
#include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main(){
scanf("%d%d%d", &n, &a, &b);
if(1LL * a * b < n || a + b - 1 > n){ puts("-1"); return 0; }
for(int i = 0, c = n - a, d = 1; i < a; i++){
for(int j = min(b - 1, c); j >= 0; j--) printf("%d ", d + j);
d += min(b - 1, c) + 1... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> w(n);
int sum = 0;
rep(i,n){
cin >> w[i];
sum += w[i];
}
int ans = 1e6;
int now = 0;
rep(i,n-1){
now += w... | 0 | 76,319,633 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
int X, A;
cin >> X >> A;
if (X < A) cout << 0 << endl;
else cout << 10 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int num, ans;
cin >> num;
ans = num / 2;
if (num % 2 == 0)
ans--;
cout << ans << endl;
return 0;
} | 0 | 11,407,346 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, ... | #include <iostream>
#define ll long long
using namespace std;
ll thick[55];
ll patty[55];
ll dfs(int n, ll x) {
if (n == 0) {
return (x <= 0) ? 0 : 1;
}
else if (x <= thick[n - 1] + 1) {
return dfs(n - 1, x - 1);
}
else if (x <= thick[n]) {
return 1 + patty[n - 1] + dfs(n - 1... | 0 | 6,522,771 |
#include <iostream>
using namespace std;
int main()
{
int point[105];
int n;
int sum=0;
cin>>n;
for(int i=0; i<n; i++)
cin>>point[i];
for(int i=0; i<n; i++)
{
if(point[i]==0)
continue;
for(int j=i+1 ; j<n; j++)
{
sum+=point[i]*point[j];... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline void rd(int &x){
int k, m=0;
x=0;
for(;;){
k = getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = getchar_unlocked();
if(k<'0'|... | 0 | 58,939,633 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#define MAXN 100000
using namespace std;
typedef long long LL;
vector<int> G[MAXN+5];
int N,d[MAXN+5];
LL a[MAXN+5],maxval[MAXN+5];
bool DFS(int u,int fa)
{
LL sum=0;
bool Enter=false;
for(int i=0;i<(int)G[u].size();i++)
{
int v=G[u][i];
if... | #include <cstdio>
#include <list>
#include <algorithm>
using namespace std;
typedef long long ll;
int main()
{
int n, i, a;
char s[20];
list<int> v;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", s);
if (s[0] == 'i') {
scanf("%d", &a);
v.push_front(a);
}
else if (s[6] == 'F... | 0 | 14,793,508 |
#include<bits/stdc++.h>
#define lld long long int
#define pb push_back
#define in insert
#define mod 1000000007
#define pi 3.14159265358979
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
lld n,a,b;
cin>>n>>a>>b;
if((abs(a-b)-1)%2==0)cout<<"Borys"<<"\n";
else cout... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <climits>
using namespace std;
int n, m, x;
int c[12], a[12][12];
int main()
{
cin >> n >> m >> x;
for (int i = 0; i < n; i++) {
cin >> c[i];
for (int j = 0; j < m; j++) {
cin >> a[... | 0 | 25,565,391 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001
#define mod 1000000007
#define pi 3.141592653589793
#define all(v) v.begin(),v.end()
int p;
ll gcd(ll a,ll b){
if(b>a) swap(a,b);
if(b==0) return a;
return gcd(b,a%b);
}
ll l... | #include <bits/stdc++.h>
using namespace std;
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
long long fibonatti(long long d){
long long count = 0;
... | 0 | 6,914,500 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define append push... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
ll a,b;
cin>>a>>b;
if(a>b){
for(ll i=0;i<a;i++)
{
cout<<b;
}
return 0;
}
else
{
for(ll i=0;i<b;i++)
{
cout<<a;
}
return 0;
}
} | 0 | 26,179,239 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,c;
cin>>a>>b;
c=a*b;
if(c%2)cout<<"Odd\n";
else cout<<"Even\n";
} | #include<iostream>
#include<map>
#include<algorithm>
using namespace std;
pair<int,int> road[10000];
int main() {
int N,M,d,p;
while(cin>>N>>M, N|M) {
for(int i=0; i<N; ++i) {
cin>>d>>p;
road[i] = pair<int,int>(p,d);
}
sort(road,road+N);
int ans = 0;
for(int i=N-1; i>=0; --i) {
if(M... | 0 | 21,325,688 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.