code1
stringlengths 54
12k
| code2
stringlengths 66
12k
| similar
int64 0
1
| __index_level_0__
int64 24
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define spdio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define pp pop_back()
#define pf push_front
#define ppf pop_front()
#define ff first
#define ss second
#define mp make_pair
#define fr(i,j,n) for(ll i=j; i<n; i++)
#define rfr(i,j,n) for(ll i=n-1; i>=j; i--)
#define pll pair<ll,ll>
#define plb pair<ll,bool>
#define psl pair<string,ll>
#define psb pair<string,bool>
#define srt(v) sort((v).begin(),(v).end())
#define ub(v,val) upper_bound((v).begin(),(v).end(),(val))-(v).begin()
#define lb(v,val) lower_bound((v).begin(),(v).end(),(val))-(v).begin()
typedef long double ld;
typedef long long int ll;
const ll inf = (ll) 1e18 + 19;
const ll mod = (ll) 1e9 + 7;
ll ncr(ll n,ll r) {
ll val=1,i,j,p=2;
rfr(i,n-r+1,n+1) {
val*=i;
while(val%p==0 && p<=r) {
val/=p;
p+=1;
}
}
if(p<r) {
fr(i,p,r+1) val/=i;
}
return val;
}
ll fun(ll h[],ll i,ll n,vector <ll> &dp) {
if(i>=n-1) return 0;
if(dp[i]!=-1) return dp[i];
if(i==n-2) return dp[i]=fun(h,i+1,n,dp)+abs(h[i+1]-h[i]);
else return dp[i]=min(fun(h,i+1,n,dp)+abs(h[i+1]-h[i]),fun(h,i+2,n,dp)+abs(h[i+2]-h[i]));
}
void cazz() {
ll t=1,i=0,j,n;
while(t--) {
cin>>n;
ll h[n];
fr(i,0,n) cin>>h[i];
vector <ll> dp(n+1,-1);
cout<<fun(h,0,n,dp)<<"\n";
}
}
int main() {
spdio;
cazz();
return 0;
} | #include<bits/stdc++.h>
#define int long long
using namespace std;
int n,a[100007],dp[1000007];
int32_t main()
{
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i],dp[i]=0;
dp[0]=0;
dp[1]=abs(a[1]-a[0]);
for(int i=2;i<n;i++)
dp[i]=min(dp[i-1]+abs(a[i]-a[i-1]),dp[i-2]+abs(a[i]-a[i-2]));
cout<<dp[n-1]<<endl;
return 0;
} | 1 | 10,483,917 |
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<bitset>
#include<string>
#include<cstdio>
#include<cctype>
#include<cassert>
#include<cstdlib>
#include<cstring>
#include<sstream>
#include<iostream>
#include<algorithm>
#define For(i,x,y) for (int i=x;i<y;i++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
int IN(){
int c,f,x;
while (!isdigit(c=getchar())&&c!='-');c=='-'?(f=1,x=0):(f=0,x=c-'0');
while (isdigit(c=getchar())) x=(x<<1)+(x<<3)+c-'0';return !f?x:-x;
}
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> Vi;
int n,m,x,y;
string s;
int main(){
n=IN(),m=IN();
For(i,0,n) For(j,0,m){
cin>>s;
if (s=="snuke") x=i,y=j;
}
printf("%c%d\n",'A'+y,x+1);
} | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main()
{
string str;
int h, w;
cin >> h >> w;
for (int i = 1; i <= h; i++) {
for (int j = 0; j < w; j++) {
cin >> str;
if (str == "snuke") {
printf("%c%d\n", 'A' + j, i);
}
}
}
return 0;
} | 1 | 93,242,412 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long ul;
int main()
{
int n;
cin >> n;
vector<int> a(n);
double sum = 0, avg;
for (int i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
avg = sum / n;
int avg2 = avg, s = 0;
avg2 += (avg - avg2 >= avg2 + 1 - avg) ? 1 : 0;
for (int i = 0; i < n; i++)
s += abs(avg2 - a[i]) * abs(avg2 - a[i]);
cout << s << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int ze(int a) {
if (a < 0) return -a;
return a;
}
int main () {
int N;
cin >> N;
vector<int>A(N);
for (int i = 0; i < N; i ++) cin >> A[i];
int sum = 0;
for (int i = 0; i < N; i ++) sum += A[i];
int ko = sum / N;
int ko_ = ko + 1;
if (sum < 0) ko_ = ko - 1;
if (ze(ko * N - sum) > ze(ko_ * N - sum)) ko = ko_;
int ans = 0;
for (int i = 0; i < N; i ++) {
ans += (A[i] - ko) * (A[i] - ko);
}
cout << ans << endl;
} | 1 | 14,542,531 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll cum_sum[200001];
ll cum_xor[200001];
ll A[200000];
bool is_ok(ll i, ll j) {
return (cum_sum[j+1] - cum_sum[i]) == (cum_xor[j+1] ^ cum_xor[i]);
}
ll find_max_ok(ll lower, ll upper) {
ll ok = lower;
ll ng = upper;
while(ng - ok > 1) {
ll trying = (ng + ok) / 2;
if (is_ok(lower, trying)) {
ok = trying;
} else {
ng = trying;
}
}
return ok;
}
int main() {
int N;
cin >> N;
for (int i=0; i<N; i++) {
cin >> A[i];
}
for (int i=0; i<N; i++) {
cum_sum[i+1] = cum_sum[i] + A[i];
cum_xor[i+1] = cum_xor[i] ^ A[i];
}
ll ans = 0;
for (int i=0; i<N; i++) {
ans += find_max_ok(i, N) - i + 1;
}
cout << ans << endl;
return 0;
} | #include<cstdio>
using namespace std;
int n;
long long a[200005];
int main()
{
scanf("%d",&n);
long long v=0,sum=0,e=1;
int left=1,right=1;
for(;right<=n;right++)
{
scanf("%d",&a[right]);
while((v^a[right])!=v+a[right])
{
sum+=right-left;
v^=a[left++];
}
v+=a[right];
}
printf("%lld",sum+e*(n-left+2)*(n-left+1)/2);
return 0;
} | 1 | 28,401,752 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
string s;
cin >> s;
int n = s.size();
int cnt0 = 0, cnt1 = 0;
rep(i, 0, n) {
if (s[i] == '0') {
cnt0++;
} else {
cnt1++;
}
}
int ans = 2 * min(cnt0, cnt1);
cout << ans << "\n";
} | #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;
int c_0 = 0, c_1 = 0;
int ans = 0;
rep(i, s.size()){
if (s[i] == '0') c_0++;
if (s[i] == '1') c_1++;
}
ans = min(c_0, c_1);
ans *= 2;
cout << ans << endl;
return 0;
} | 1 | 35,872,775 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
int x,y,T,ans,tmp,tmp2;
scanf("%d",&T);
while(T--)
{
ans=0;
scanf("%d%d",&x,&y);
if(x>y)
{
swap(x,y);
}
if(y==1)
ans=0;
else
{
ans+=x-1;
tmp=sqrt((long long)y*x);
if((long long)tmp*tmp==(long long)x*y)
{
ans--;
}
ans+=tmp;
tmp2=((long long)x*y-1)/tmp;
if(tmp2-x>0)
ans+=(tmp2-x);
if(((long long)x*y-1)/tmp2==tmp)
ans--;
}
printf("%d\n",ans);
}
return 0;
} | #include <cstdio>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
int main()
{
int Q;
long long int a, b1, b, s, ans;
scanf("%d", &Q);
for(int i=0; i<Q; i++){
scanf("%lld %lld", &a, &b);
if(a<b){
b1=b;
b=a;
a=b1;
}
long long int s1=b-1, s2=a+1;
while(s1!=s2){
long long int smid=(s1+s2+1)/2;
if(smid*smid<a*b){
s1=smid;
}else{
s2=smid-1;
}
}
s=s1;
if(a==b){
ans=2*(b-1);
}else if(a==b+1){
ans=2*b-2;
}else if(a==b+2){
ans=2*b-1;
}else if(a==4 && b==1){
ans=1;
}else if(s*(s+1)<a*b){
ans=2*s-1;
}else{
ans=2*s-2;
}
printf("%lld\n", ans);
}
return 0;
} | 1 | 30,751,461 |
#include <iostream>
using namespace std;
int gcd(int a, int b) {
if (b > a) {
int tmp = a;
a = b;
b = tmp;
}
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
int n, a, cgcd;
cin >> n >> cgcd;
for (int i = 1; i < n; i++) {
cin >> a;
cgcd = gcd(cgcd, a);
}
cout << cgcd;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
int amari = a[0];
while(1){
bool isconst = true;
for(int i = 0; i < n; i++){
if(a[i] % amari != 0){
amari = a[i] % amari;
a[i] = amari;
isconst = false;
}
}
if(isconst) break;
}
cout << amari << endl;
} | 1 | 65,665,378 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(){
string s;
string p;
cin>>s>>p;
char tmp[300];
for(int i=1;i<=2;i++){
for(int j=0;j<s.size();j++){
if(i==2){
tmp[j+s.size()]=s[j];
}
else{
tmp[j]=s[j];
}
}
}
bool judge=false;
for(int i=0;i<s.size()+s.size();i++){
if(p[0]==tmp[i]){
judge=true;
for(int j=0;j<p.size();j++){
if(p[j]!=tmp[i+j]){
judge=false;
break;
}
}
}
if(judge){
break;
}
}
if(judge){
cout<<"Yes"<<endl;
}
else cout<<"No"<<endl;
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
char s[100],p[100];
int c = 0;
int d = 0;
while(1){
char a;
scanf("%c",&a);
if(a=='\n') break;
s[c] = a;
c++;
}
while(1){
char a;
scanf("%c",&a);
if(a=='\n') break;
p[d] = a;
d++;
}
if(c<d){ cout << "No" << endl; return 0;}
else{
for(int i=0;i<c;i++){
int b = 0;
for(int j=0;j<d;j++){
int t = (j+i)%c;
if(p[j]==s[t]) b++;
else break;
}
if(b==d){ cout << "Yes" << endl; return 0;}
}
}
cout << "No" << endl;
} | 1 | 26,697,297 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
cout << S[0];
for (int i = 2; i < S.size(); i++) {
if (i % 2 == 0) {
cout << S[i];
}
}
cout << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
using namespace std;
const int INF = 1e9;
int main() {
string s;
cin >> s;
rep(i, s.size()) if (i % 2 == 0) cout << s[i];
cout << endl;
return 0;
} | 1 | 36,580,231 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
int main(){
int a,b;
cin>>a>>b;
char c='0'+a ,d='0'+b;
string x(a,d),y(b,c);
if(x<y)cout<<x<<endl;
else cout<<y<<endl;
} | #include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define print(a) printf("%d\n",a);
#define scanii(a,b) scanf("%d %d",&a,&b);
#define printii(a,b) printf("%d\n%d\n",a,b);
#define scaniii(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define ll long long
#define ull unsigned long long
#define sll signed long long
#define pi acos(-1)
#define mod 1000000007
#define TRUE 1
#define FALSE 0
#define ZERO 0
#define MP make_pair
#define F first
#define S second
#define f1(i,a) for(int i=0;i<a;++i)
#define f2(i,a) for(int i=a-1;i>=0;--i)
#define en puts("");
#define elif else if
typedef ll int lli;
typedef sll int slli;
typedef ull int ulli;
const int sz=10000;
using namespace std;
int clue();
int result();
void show();
bool check();
bool cmp(int p,int q) {
return p>q;
}
int main() {
int t;
t=1;
while(t-->0) {
clue();
}
return 0;
}
int clue() {
int a,b;
cin>>a>>b;
int n=max(a,b);
int m=min(a,b);
f1(i,n) {
cout<<m;
}
en
return 0;
} | 1 | 93,750,626 |
#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 dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
const ll INF=1e18;
int main() {
ll n,m,k;
cin >>n>>m;
rep(i,n){
rep(j,n-i){
k=n-i-j;
if(m==i*10000+j*5000+k*1000){
cout << i<<" "<< j<<" "<<k<<endl;
return 0;
}
}
}
cout <<"-1 -1 -1"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define ll long long
static const ll MAX = 10000;
static const ll INFTY = 1e12;
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 dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
using P = pair<ll, ll>;
ll h, w;
ll startX, startY, endX, endY;
vector<vector<char>> s;
vector<vector<ll>> cnts;
int main() {
ll N, Y;
cin >> N >> Y;
REP(i, N+1){
ll M = N - i;
REP(j, M+1){
ll k = M - j;
if(10000 * i + 5000 * j + 1000 * k == Y){
cout << i << " " << j << " " << k << endl;
return 0;
}
}
}
cout << "-1 -1 -1" << endl;
} | 1 | 31,682,446 |
#include<iostream>
using namespace std;
int main(){
int m,f,r;
char c;
while(1){
cin>>m>>f>>r;
if(m==-1&&f==-1&&r==-1)break;
if(m==-1||f==-1) c='F';
else if(m+f>=80) c='A';
else if(m+f>=65) c='B';
else if(m+f>=50||m+f>=30&&r>=50) c='C';
else if(m+f>=30) c='D';
else c='F';
cout<<c<<endl;
}
} | #include<iostream>
using namespace std;
int main(){
int m,f,r,x;
while(1){
cin>>m>>f>>r;
if(m==-1 && f==-1 && r==-1){
break;
}
x=m+f;
if( x<30 || m==-1 || f==-1){
cout<<"F"<<endl;
}
else if(x>=30 && x<50 && m!=-1 && f!=-1 && r<50){
cout<<"D"<<endl;
}
else if(x>=50 && x<65 && m!=-1 && f!=-1 || x>=30 && x<50 && m!=-1 && f!=-1 && r>=50){
cout<<"C"<<endl;
}
else if(x>=65 && x<80 && m!=-1 && f!=-1){
cout<<"B"<<endl;
}
else if(x>=80 && m!=-1 && f!=-1){
cout<<"A"<<endl;
}
}
return 0;
} | 1 | 21,983,410 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1e9+7;
const LL LINF=1LL<<62;
vector<LL> v;
int main(){
int N,K;
cin >> N >> K;
for(int i=0;i<N;i++){
LL t;
cin >> t;
v.pb(t);
}
sort(ALL(v));
int l=0,r=N;
while(l<r){
vector<vector<bool>> dp(N+1,vector<bool> (K+1));
int mid=(r+l)/2;
LL t=v[mid];
if(t>=K){
if(r==mid){
break;
}
r=mid;
continue;
}
v[mid]=0;
dp[0][0]=true;
for(int i=0;i<N;i++){
for(int j=0;j<K;j++){
if(dp[i][j]){
dp[i+1][j]=true;
if(j+v[i]<=K) dp[i+1][j+v[i]]=true;
}
}
}
bool c=false;
for(int i=K-t;i<K;i++){
if(dp[N][i]){
c=true;
}
}
if(c){
if(r==mid){
break;
}
r=mid;
}
else{
if(l==mid){
break;
}
l=mid;
}
v[mid]=t;
}
cout << r << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define fir first
#define sec second
#define mod 998244353
inline int read()
{
char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
if(nega==-1) return -ans;
return ans;
}
typedef pair<int,int> pii;
int add(int x,int y){return x+y>=mod?x+y-mod:x+y;}
int sub(int x,int y){return x-y<0?x-y+mod:x-y;}
int mul(int x,int y){return 1LL*x*y%mod;}
#define N 5005
int f[N],a[N];
signed main()
{
#ifdef __LOCAL__
freopen("in.txt","r",stdin);
#endif
int n,k,sum=0;
cin>>n>>k;
for(int i=1;i<=n;i++)
{
a[i]=min(read(),k);
sum+=a[i];
}
f[0]=1;
sort(a+1,a+n+1);
for(int i=n;i>=0;i--)
{
bool ok=0;
for(int j=k-1;j>=k-sum&&j>=0;j--)
{
if(f[j]) ok=1;
}
if(!ok)
{
cout<<i<<endl;
return 0;
}
for(int j=k;j>=a[i];j--) f[j]|=f[j-a[i]];
sum-=a[i];
}
#ifdef __LOCAL__
cout<<"Time Used : "<<clock()<<endl;
#endif
return 0;
} | 1 | 50,474,492 |
#include <iostream>
using namespace std;
int main() {
int W,H,x,y,r;
cin >> W >> H >> x >> y >> r;
cout << ((x-r < 0 || W < x+r || y-r < 0 || H < y+r) ? "No" : "Yes") << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int W;
int H;
int x;
int y;
int r;
cin>>W>>H>>x>>y>>r;
if(x-r>=0&&y-r>=0&&x+r<=W&&y+r<=H){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | 1 | 59,233,128 |
#include <stdio.h>
int main()
{
int a, b;
scanf("%d %d", &a, &b);
if (a==1 && b==2)
{
printf("3");
}
else if(a==2 && b==1)
{
printf("3");
}
else if(a==2 && b==3)
{
printf("1");
}
else if(a==3 && b==2)
{
printf("1");
}
else if (a==1 && b==3)
{
printf("2");
}
else if(a==3 && b==1)
{
printf("2");
}
return 0;
} | #include<bits/stdc++.h>
using namespace std ;
int main() {
int A ,B ;
cin >> A >> B ;
if( A == 1){
if (B == 2){
cout << 3 << endl ;
}
else {
cout << 2 << endl ;
}
}
else if (A == 2){
if (B==1){
cout << 3 << endl ;
}
else {
cout << 1 << endl ;
}
}
else if (A == 3){
if (B==2){
cout << 1 << endl ;
}
else {
cout << 2 << endl ;
}
}
} | 1 | 26,701,183 |
#include <iostream>
using namespace std;
int main() {
int ch[3]={0};
string str;
cin >> str;
bool flag = true;
for(int i=0; i<3; i++) {
if(ch[(int)(str[i]-'a')]==0) {
ch[(int)(str[i]-'a')]++;
} else {
flag = false;
break;
}
}
if(flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
string s;
cin >> s;
vector<int> a(3);
rep(i,3){
if(s.at(i)=='a') a.at(0) ++;
else if(s.at(i)=='b') a.at(1) ++;
else if(s.at(i)=='c') a.at(2) ++;
}
if(a[0]==1 && a[1]==1 && a[2]==1){
cout << "Yes" << endl;
}
else cout << "No" << endl;
} | 1 | 24,406,244 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
const int N=100001;
vector<int>g[N];
ll dp[N][2];
ll solve(ll src,ll par,ll tight)
{
if(dp[src][tight]!=-1)
{
return(dp[src][tight]);
}
if(tight==1)
{
ll ans=1;
ll f=0;
for(auto x:g[src])
{
if(x!=par)
{
f=1;
ll p=solve(x,src,0);
ans=(ans*p)%mod;
}
}
return(dp[src][tight]=ans);
}
else
{
ll ans1=1;
ll f=0;
for(auto x:g[src])
{
if(x!=par)
{
f=1;
ll p=solve(x,src,1);
ans1=(ans1*p)%mod;
}
}
ll ans2=1;
for(auto x:g[src])
{
if(x!=par)
{
ll p=solve(x,src,0);
ans2=(ans2*p)%mod;
}
}
ans1=(ans1+ans2)%mod;
return(dp[src][tight]=(ans1)%mod);
}
}
int main()
{
ll n,i;
cin>>n;
ll x,y;
memset(dp,-1,sizeof(dp));
for(i=0;i<n-1;i++)
{
cin>>x>>y;
g[x].push_back(y);
g[y].push_back(x);
}
ll ans1=solve(1,-1,0);
cout<<ans1<<"\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
int n;
vector<vector<int>> adj;
vector<vector<ll>> dp;
ll solve(int cur, int prev, int col) {
if (dp[cur][col] != -1)
return dp[cur][col];
ll tot = 0, w = 1;
if (col == 0) {
for (auto it : adj[cur]) {
if (it != prev) {
w = (w * solve(it, cur, 1)) % mod;
}
}
tot += w;
}
w = 1;
for (auto it : adj[cur]) {
if (it != prev) {
w = (w * solve(it, cur, 0)) % mod;
}
}
tot = (tot + w) % mod;
return dp[cur][col] = tot;
}
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
adj.resize(n);
dp.resize(n);
for (int i = 0; i < n; i++) {
dp[i].resize(2, -1);
}
for (int i = 0; i < n - 1; i++) {
int x, y;
cin >> x >> y;
x--, y--;
adj[x].push_back(y);
adj[y].push_back(x);
}
ll answer = solve(0, -1, 0);
cout << answer;
return 0;
} | 1 | 37,159,115 |
#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;
ll f(ll x){
if(x%2==1)return 3*x+1;
return x/2;
}
int main(){
ll s;cin >>s;
map<ll,int>mp;
ll i=1;
while(1){
mp[s]++;
if(mp[s]>=2){
break;
}
s=f(s);
i++;
}
cout <<i<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll s;
cin >> s;
set<ll> appear;
int ans = 1;
while (1) {
if (appear.count(s)) break;
appear.emplace(s);
if (s & 1) s = 3 * s + 1;
else s /= 2;
++ans;
}
cout << ans << '\n';
return (0);
} | 1 | 94,451,939 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
priority_queue<int> pq;
while (1) {
string s;
cin >> s;
if (s == "insert") {
int k;
scanf("%d", &k);
pq.push(k);
} else if (s == "extract") {
printf("%d\n", pq.top());
pq.pop();
} else if (s == "end") break;
}
} | #include <cstdlib>
#include <cstdio>
#include <string>
#include <iostream>
using namespace std;
template <typename T> class Heap{
struct node_t{
T val;
int dep;
node_t *l;
node_t *r;
node_t(T _val) : val(_val), dep(0), l(NULL), r(NULL){}
~node_t(){
if(l != NULL) delete l;
if(r != NULL) delete r;
}
};
node_t *root;
node_t *meld(node_t *a, node_t *b){
if(a == NULL) return b;
if(b == NULL) return a;
if(a->val < b->val) swap(a, b);
a->r = meld(a->r, b);
if(a->l == NULL || a->l->dep < a->r->dep) swap(a->l, a->r);
a->dep = (a->r == NULL ? 0 : a->r->dep) + 1;
return a;
}
public:
Heap() : root(NULL) {}
~Heap() { delete root; }
void meld(Heap &h){
root = meld(this->root, h.root);
}
void insert(T val){
root = meld(this->root, new node_t(val));
}
T min_element(){
return root->val;
}
T pop(){
T ret = min_element();
root = meld(root->l, root->r);
return ret;
}
bool empty(){
return root == NULL;
}
};
int main(){
char com[10];
int n;
Heap<int> heap;
while(scanf("%s", com) && com[2] != 'd'){
if(com[0] == 'i'){
scanf("%d", &n);
heap.insert(n);
}else{
cout << heap.pop() << endl;
}
}
return 0;
} | 1 | 83,950,530 |
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(-1)
const ll INF = 10010001010;
const int inf = 2000000000;
typedef tuple<string, int, int> TUP;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main()
{
int X1, Y1, X2, Y2;
cin >> X1 >> Y1 >> X2 >> Y2;
int height = abs(Y2 - Y1);
cout << X2 - Y2 + Y1 << " " << Y2 + X2 - X1 << " " << X1 - Y2 + Y1 << " " << Y1 + X2 - X1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
vector<int> x(4), y(4);
cin >> x[0] >> y[0] >> x[1] >> y[1];
x[2] = x[1] - (y[1] - y[0]);
y[2] = y[1] - (x[0] - x[1]);
x[3] = x[0] - (y[1] - y[0]);
y[3] = y[0] + (x[1] - x[0]);
cout << x[2] << " " << y[2] << " " << x[3] << " " << y[3] << endl;
} | 1 | 62,407,570 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 101234567;
int main() {
ll N;
ll ans = 0;
vector<ll>v;
cin >> N;
for (int k = 1; k < (double)sqrt(N); k++) {
if (N % k == 0) {
ll m = N/k - 1;
if (m > k) {
ans += m;
}
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(){
long long N;
cin >> N;
long long res = 0;
for(long long i=1;i*i<=N;i++){
if(N % i == 0){
long long j = i-1;
long long k = N / i - 1;
if(j && N/j == N%j) res += j;
if(i * i != N && k && N/k == N%k) res += k;
}
}
cout << res << endl;
return 0;
} | 1 | 30,114,299 |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x,y,h,w) x >= 0 && x < h && y >= 0 && y < w
#define int long long
using P = pair<int,int>;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
const int INF=1e+18;
const double EPS=1e-9;
const int MOD=1000000007;
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
signed main(){
int n,a[100010],mi = INF,mii,ma = -INF,mai;
cin >> n;
for(int i = 0;i < n;i++){
cin >> a[i];
if(mi > a[i]){
mi = a[i];
mii = i;
}
if(ma < a[i]){
ma = a[i];
mai = i;
}
}
if(mii == mai) mai = (mai + 1) % n;
vector<P> sousa;
if(mi >= 0){
for(int i = 0;i < n;i++){
if(i != mii && i != mai){
sousa.emplace_back(a[mii],a[i]);
a[mii] -= a[i];
}
}
sousa.emplace_back(a[mai],a[mii]);
a[mai] -= a[mii];
}else if(ma <= 0){
for(int i = 0;i < n;i++){
if(i != mai){
sousa.emplace_back(a[mai],a[i]);
a[mai] -= a[i];
}
}
}else{
for(int i = 0;i < n;i++){
if(a[i] >= 0 && i != mai){
sousa.emplace_back(a[mii],a[i]);
a[mii] -= a[i];
}
}
sousa.emplace_back(a[mai],a[mii]);
a[mai] -= a[mii];
for(int i = 0;i < n;i++){
if(a[i] < 0 && i != mii){
sousa.emplace_back(a[mai],a[i]);
a[mai] -= a[i];
}
}
}
cout << a[mai] << endl;
for(P p : sousa) cout << p.first << " " << p.second << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define debug(var) do{std::cout << #var << " : "; view(var);}while(0)
using namespace std;
typedef long long ll;
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){for(const auto& v : vv){ view(v); } }
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void viewarr(T arr[], int n) { for(int i = 0; i < n; ++i) std::cout << arr[i] << " "; std::cout << std::endl; }
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) { a=b; return 1; } return 0; }
const int INF = 1e9;
const int MAX_N = 100010;
ll A[MAX_N];
int main() {
int N; cin >> N;
rep(i,N) cin >> A[i];
vector<pair<ll,ll>> ans;
sort(A, A+N);
int Q = 0;
rep(i,N) {
if(A[i] < 0) ++Q;
}
if(Q == 0) Q = 1;
if(Q == N) Q = N - 1;
for(int i = Q; i < N-1; ++i) {
ans.push_back(make_pair(A[0], A[i]));
A[0] = A[0] - A[i];
}
for(int i = 0; i < Q; ++i) {
ans.push_back(make_pair(A[N-1], A[i]));
A[N-1] = A[N-1] - A[i];
}
cout << A[N-1] << endl;
for(const auto e : ans) cout << e.first << " " << e.second << endl;
return 0;
} | 1 | 79,213,625 |
#include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
if ((a * b) % 2) {
std::cout << "Odd" << std::endl;
} else {
std::cout << "Even" << std::endl;
}
} | #include <iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
a=a*b;
if(a%2==0)
cout<<"Even";
if(a%2==1)
cout<<"Odd";
return 0;
} | 1 | 79,373,203 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,w) for (int i = 0;i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int n;cin >> n;
string s;cin >> s;
int ans = 0;
rep(num,1000){
string temp = "";
temp.push_back('0'+(num/100));
temp.push_back('0'+((num/10)%10));
temp.push_back('0' + (num%10));
int ind = 0;
int i = 0;
while(ind < 3){
if(i == s.size()) break;
if(s[i]==temp[ind]){
if(ind == 2) ans++;
ind++;
}
i++;
}
}
cout << ans << endl;
} | #include <iostream>
#include <map>
using namespace std;
int main() {
long N;
string S;
cin >> N >> S ;
string a1 = "";
string a2 = "";
string a3 = "";
int cnt = 0;
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
for (int k = 0; k < 10; k++) {
bool hit1 = false;
bool hit2 = false;
bool hit3 = false;
for (int n = 0; n < S.size(); n++) {
if(hit1 == false && i == S[n] - 48){
hit1 = true;
continue;
}
if(hit1){
if(hit2 == false && j == S[n]- 48){
hit2 = true;
continue;
}
}
if(hit2){
if(k == S[n] - 48){
hit3 = true;
cnt++;
break;
}
}
}
}
}
}
cout << cnt << endl;
return 0;
} | 1 | 71,175,181 |
#include<iostream>
#include<stdio.h>
#include<string>
using namespace std;
int main(){
int a, b;
std::string sep;
cin >> a >> b;
if(a == b) {
sep = "==";
} else if(a > b) {
sep = ">";
} else {
sep = "<";
}
cout << "a " << sep << " b" << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#define REP(i,n) for(int i=0;i<n;i++)
#define OUTPUT(a,b,s) cout << s << '\n'
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < b)
OUTPUT(a,b,"a < b");
else if (a > b)
OUTPUT(a,b,"a > b");
else
OUTPUT(a,b,"a == b");
} | 1 | 59,767,852 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define sz(x) (int)x.size()
#define mod 1000000007
#define EPS 1e-9
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define inf 1e10
#define PI acos(-1.0)
#define int long long
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 100005
void solve(){
char c;
cin>>c;
cout<<(char)(c+1)<<endl;
}
signed main(){
io;
int tests;
tests = 1;
while(tests--){
solve();
}
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree<ll,null_type,less<ll>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define int ll
#define endl "\n"
#define all( x ) x.begin(), x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef unsigned long long ull;
const int inf = 1e9 + 5;
const long double PI = 3.141592653589793;
void solve(){
char c;
cin >> c;
c+=1;
cout << c;
return;
}
signed main(){
fast;
int t;
t = 1;
while(t--){
solve();
}
} | 1 | 96,107,133 |
#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 rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
int main(){
int N;
cin >> N;
int A[N];
rep(i, N) cin >> A[i];
ll l = 0, r = INF;
while(r-l > 1){
ll n = (l+r)/2;
bool able = true;
map<int, ll> mp;
rep(i, N){
if(i == 0 || A[i] > A[i-1]) continue;
if(n == 1) {able = false; break;}
mp[A[i]]++;
map<int, ll>::iterator it = mp.find(A[i]);
it++;
while(it != mp.end()) it = mp.erase(it);
int now = A[i];
while(now > 0 && mp[now] == n){
mp.erase(now--);
mp[now]++;
}
if(now == 0) {able = false; break;}
}
if(able) r = n;
else l = n;
}
cout << r << endl;
} | #include<bits/stdc++.h>
using namespace std;
const int N=2e5+11;
int a[N],n;
int chk(int m){
int i;
if(m==1){
for(i=1;i<n;++i)if(a[i]>=a[i+1])return 0;
return 1;
}
map<int,int> f;
for(i=2;i<=n;++i)if(a[i]<=a[i-1]){
f.erase(f.upper_bound(a[i]),f.end());
int k=a[i];
++f[k];
while(k>0&&f[k]==m)f.erase(k),++f[--k];
if(!k)return 0;
}
return 1;
}
int main(){
cin>>n;
int i;
for(i=1;i<=n;++i)scanf("%d",a+i);
int l=1,r=n,m;
while(l<r){
m=l+r>>1;
if(chk(m))r=m;
else l=m+1;
}
cout<<l;
} | 1 | 8,403,808 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")
#define No puts("No")
#define ALL(v) (v).begin(), (v).end()
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
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 (a>b) { a=b; return 1; } return 0; }
#if 1
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
template <typename T>
istream& operator>>(istream& is, vector<T>& vec) {
for (T& x : vec) is >> x;
return is;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, pair<T, U>& pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
os << "{";
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
os << "}";
return os;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, map<T, U>& map_var) {
os << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
template <typename T>
ostream& operator<<(ostream& os, set<T>& set_var) {
os << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
#define DUMPOUT cerr
void dump_func() {
DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head&& head, Tail&& ... tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
#ifdef DEBUG
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" \
<< endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}
template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
for(auto &e:t) fill_v(e,v);
}
#endif
#define mod 1000000007 /*/
#define mod 998244353
typedef pair<int, int> P;
#define INF (1LL<<60)
void solve(){
int N;
cin >> N;
vector<int> A(N);
rep(i,N) cin >> A[i];
int P=1;
int ans = 0;
rep(i,N){
if(A[i]==P) P++;
else{
ans += (A[i]-1)/P;
}
if(i==0) P=2;
}
cout << ans << endl;
}
signed main(){
cout << fixed << setprecision(18);
cerr << fixed << setprecision(18);
solve();
} | #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<cctype>
#include <fstream>
#include <time.h>
#include <iterator>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v,n) reverse(v,v+n);
#define VREVERSE(v) reverse(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define m0(x) memset(x,0,sizeof(x))
#define fil(x,y) memset(x,y,sizeof(x))
#define print(x) cout<<x<<endl;
#define pe(x) cout<<x<<" ";
#define lb(v,n) lower_bound(v.begin(), v.end(), n);
#define ub(v,n) upper_bound(v.begin(), v.end(), n);
#define int long long
#define all(x) (x).begin(), (x).end()
using namespace std;
int MOD = (ll)1000000000 + 7;
const ll INF = 1e17;
const double pi = acos(-1);
const double EPS = 1e-10;
const int MAX = 500000;
int N;
int A[100010];
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
REP(i, N) {
cin >> A[i];
}
int ans = 0;
int mn = 0;
ans = A[0] - 1;
mn = 1;
FOR(i,1, N) {
int cnt = (A[i] - 1) / (mn + 1);
if (cnt == 0) {
if (A[i] == mn + 1)mn++;
}
else {
ans += cnt;
}
}
print(ans);
} | 1 | 40,474,002 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
int cost[12][12];
int n,a,b,c;
int s,min_cost;
int main(){
while(scanf("%d",&n),n!=0){
memset(cost,255,sizeof(cost));
for(int i=0;i<n;i++){
scanf("%d %d %d",&a,&b,&c);
cost[a][b]= (cost[a][b]==-1) ? c : min(cost[a][b],c);
cost[b][a]=cost[a][b];
}
for(int i=0;i<=10;i++)
cost[i][i]=0;
for(int k=0;k<=10;k++)
for(int i=0;i<=10;i++)
for(int j=0;j<=10;j++)
if(cost[i][k]!=-1&&cost[k][j]!=-1){
cost[i][j]= (cost[i][j]==-1) ? cost[i][k]+cost[k][j] : min(cost[i][j],cost[i][k]+cost[k][j]);
cost[j][i]=cost[i][j];
}
s=-1;min_cost=-1;
for(int i=0;i<=10;i++){
int temp=0;
for(int j=0;j<=10;j++)
temp= (cost[i][j]==-1) ? temp : temp+cost[i][j];
if(s==-1||temp<min_cost&&temp>0){
min_cost=temp;
s=i;
}
}
printf("%d %d\n",s,min_cost);
}
return 0;
} | #include <iostream>
using namespace std;
const int INF = 1000000000;
int main()
{
while(true){
int n;
cin >> n;
if(n==0)
break;
int T[10][10];
for(int i=0; i<10; i++){
for(int j=0; j<10; j++){
if(i==j){
T[i][j] = 0;
}
else{
T[i][j] = INF;
}
}
}
int m = 0;
for(int i=0; i<n; i++){
int a, b, c;
cin >> a >> b >> c;
T[a][b] = T[b][a] = c;
if(a+1>m){
m = a+1;
}
if(b+1>m){
m = b+1;
}
}
int d[m][m];
for(int i=0;i<m;i++){
for(int j=0;j<m;j++){
d[i][j]=T[i][j];
}
}
for(int k=0;k<m;k++){
int count=0;
for(int i=0;i<m;i++){
for(int j=0;j<m;j++){
if(d[i][j]>d[i][k]+d[k][j]){
d[i][j]=d[i][k]+d[k][j];
d[j][i]=d[j][k]+d[k][i];
}
}
}
}
int l=0;
int count=10000000;
for(int i=0;i<m;i++){
int a=0;
for(int j=0;j<m;j++){
int l=0;
a+=d[i][j];
}
if(a<count){
count=a;
l=i;
}
}
cout<<l<<" "<<count<<endl;
}
return 0;
} | 1 | 76,424,834 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(),(x).end()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
#define v vector
const int INF = 1000000007;
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
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; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
int solve(){
int n;
cin >> n;
v<int>d(n),cnt(n);
rep(i,n)cin >> d[i];
rep(i,n)++cnt[d[i]];
int MAX = *max_element(all(d));
bool can = true;
if(d[0] != 0 || cnt[0] != 1)can = false;
ll ans = 1;
REP(i,1,MAX+1){
if(cnt[i] == 0)can = false;
rep(j,cnt[i]){
ans = ans * cnt[i - 1] % 998244353;
}
}
if(!can)ans = 0;
cout << ans << endl;
return 0;
}
int main(){
solve();
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 998244353;
int main() {
ll N, x, m{}, ans{1};
cin >> N;
vector<int> D(N);
for (int i = 0; i != N; ++i) {
cin >> x;
if ((!i && x) || (i && !x)) {
cout << 0 << endl;
return 0;
}
m = max(m,x);
++D[x];
}
for (int i = 1; i <= m; ++i) {
if (!D[i]) {
ans = 0;
break;
}
for (int j = 0; j != D[i]; ++j) {
ans = ans * D[i-1] % MOD;
}
}
cout << ans << endl;
} | 1 | 66,151,605 |
#include <bits/stdc++.h>
using namespace std;
vector<int64_t> memo(100, -1);
int64_t Luca(int N) {
if (memo.at(N) !=-1) return memo.at(N);
if (N==1) return 1;
return memo.at(N) = Luca (N-1) + Luca (N-2);
}
int main(){
int N;
cin >> N;
memo.at(0) = 2;
memo.at(1) = 1;
cout << Luca (N) << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw "\n"
ll arr[100];
void lucas(ll n)
{
arr[0]=2;
arr[1]=1;
for(ll i=2;i<=n;i++)arr[i]=arr[i-1]+arr[i-2];
}
int main(void)
{
CIN;
ll tc,l,k,sum=0,x=0,y,z=0,m=1,n=0,ans=0,cnt=0;
cin>>n;
lucas(n);
cout<<arr[n];
} | 1 | 17,708,910 |
#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() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<ll> cum(n+1);
cum[0] = 0;
rep(i, n) cum[i+1] = cum[i] + a[i];
sort(cum.begin(), cum.end());
ll ans = 0;
ll now = cum[0];
while (1) {
int ib = lower_bound(cum.begin(), cum.end(), now) - cum.begin();
int ie = upper_bound(cum.begin(), cum.end(), now) - cum.begin();
ans += (ll)(ie - ib) * (ie - ib - 1) / 2;
if (ie == cum.size()) break;
now = cum[ie];
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <map>
using namespace std;
int main() {
int n; cin >> n;
long long A[n];
for (int i = 0; i < n; i++) cin >> A[i];
long long S[n+1] = {};
for (int i = 0; i < n; i++) S[i+1] = S[i] + A[i];
map<long long, long long> nums;
for (int i = 0; i < n + 1; i++) nums[S[i]]++;
long long ans = 0;
for (auto it : nums) {
long long num = it.second;
ans += num * (num - 1) / 2;
}
cout << ans << endl;
} | 1 | 78,402,477 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> AB(2);
for (int i=0;i<2;++i) cin >> AB[i];
int K; cin >> K;
for (int i=0;i<K;++i){
if (AB[i&1]&1) --AB[i&1];
AB[(i&1)^1]+=AB[i&1]/2;
AB[i&1]/=2;
}
cout << AB[0] << ' ' << AB[1] << '\n';
} | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
int abs(int a,int b){
int c=max(a,b)-min(a,b);
return c;
}
priority_queue<int, vector<int>, greater<int> > qu;
signed main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int a,b,c;
int d=0,e=0;
cin>>a>>b>>c;
for(int i=0;i<c;i++){
if(i%2==0){
if(a%2==1) a--;
a/=2;
b+=a;
}
else{
if(b%2==1) b--;
b/=2;
a+=b;
}
}
cout<<a<<" "<<b<<"\n";
} | 1 | 75,458,198 |
#include <iostream>
#include <string>
const int MAX_X = 1100;
const int MAX_Y = 1100;
int main() {
std::string X;
std::string Y;
int q;
int answers[160];
std::cin >> q;
int dp[MAX_X][MAX_Y];
for(int p=0; p<q; ++p) {
std::cin >> X;
std::cin >> Y;
for(int i=0; i<MAX_X; ++i) {
for(int j=0; j<MAX_Y; ++j) {
dp[i][j] = 0;
}
}
int xlen = X.size();
int ylen = Y.size();
X = " " + X;
Y = " " + Y;
for(int i=1; i<=xlen; ++i) {
for(int j=1; j<=ylen; ++j) {
if(X[i] == Y[j]) {
dp[i][j] = dp[i-1][j-1] + 1;
} else {
dp[i][j] = std::max(
dp[i][j-1],
dp[i-1][j]
);
}
}
}
answers[p] = dp[xlen][ylen];
}
for(int i=0; i<q; ++i) {
std::cout << answers[i] << std::endl;
}
} | #include <iostream>
using namespace std;
int max(int a, int b) { return a < b ? b : a; }
int lcs(string x, string y) {
int c[1001][1001] = {0};
int m = x.size();
int n = y.size();
int maxl = 0;
x = ' ' + x;
y = ' ' + y;
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= n; ++j) {
if (x[i] == y[j]) {
c[i][j] = c[i - 1][j - 1] + 1;
} else {
c[i][j] = max(c[i - 1][j], c[i][j - 1]);
}
maxl = max(maxl, c[i][j]);
}
}
return maxl;
}
int main() {
int n;
cin >> n;
string s1, s2;
for (int i = 0; i < n; ++i) {
cin >> s1 >> s2;
cout << lcs(s1, s2) << endl;
}
return 0;
} | 1 | 97,563,718 |
#include<iostream>
#include<vector>
#include<numeric>
using namespace std;
int main()
{
constexpr int kinf=100001;
int N,K;
cin>>N;
vector<int>B;
for (int i = 0; i < N-1; i++)
{
int b;
cin>>b;
B.push_back(b);
}
B.push_back(kinf);
vector<int>A(N);
A[0]=B[0];
for (int i = 1; i < N; i++)
{
A[i]=min(B[i-1],B[i]);
}
int ans =accumulate(A.begin(),A.end(),0);
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
long long n,ans=0;
cin>>n;
long long b[n-1],a[n];
f(i,0,n-1){
cin>>b[i];
}
a[0]=b[0];
a[n-1]=b[n-2];
f(i,1,n-1){
if(b[i-1]<b[i]){
a[i]=b[i-1];
}
else{
a[i]=b[i];
}
}
f(i,0,n){
ans+=a[i];
}
cout<<ans<<endl;
return 0;
} | 1 | 42,502,699 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
int h1,m1,h2,m2,k; cin>>h1>>m1>>h2>>m2>>k;
int ans=(h2-h1)*60;
if(m1<=m2) ans+=m2-m1;
else ans-=m1-m2;
cout<<ans-k<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int h1,m1,h2,m2,k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int hun = ((h2+24)*60 + m2 - ((h1*60)+m1))%(24*60);
cout << hun - k << endl;
return 0;
} | 1 | 83,947,012 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define vector1d(type,name,...) vector<type>name(__VA_ARGS__)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
const int MOD2=998244353;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}
int main(){
vector<ll> Humburger(51),Patty(51);
Humburger[0]=1;
Patty[0]=1;
for(int i=1;i<=50;i++){
Humburger[i]=2*Humburger[i-1]+3;
Patty[i]=2*Patty[i-1]+1;
}
LL(n,x);
ll ans=0;
for(int i=n;i>=0;i--){
if(x==Humburger[i]){
ans+=Patty[i];
break;
}else if(x>Humburger[i-1]+2){
ans+=Patty[i-1]+1;
x-=Humburger[i-1]+2;
}else if(x==Humburger[i-1]+2){
ans+=Patty[i-1]+1;
break;
}else if(x>1){
x--;
}else if(x==1){
if(i==0)ans++;
break;
}
}
out(ans);
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n;
ll x;
cin>>n>>x;
vector<ll> psum(n+1), len(n+1);
psum[0]=1; len[0]=1;
rep(i,n){
psum[i+1]=2*psum[i]+1;
len[i+1]=2*len[i]+3;
}
ll ans=0;
while(x>0){
if(n==0){
if(x==1) ans++;
x--;
}
else{
if(x>(len[n-1]+1)){
ans+=(psum[n-1]+1);
x-=(len[n-1]+2);
n--;
}
else if(x==(len[n-1]+1)){
ans+=psum[n-1];
x-=(len[n-1]+1);
n--;
}
else{
x--;
n--;
}
}
}
cout<<ans<<endl;
return 0;
} | 1 | 89,202,760 |
#include <bits/stdc++.h>
using namespace std;
int main (){
string A,op,B;
cin >> A >> op >> B;
std::istringstream ss1,ss2;
ss1 =std::istringstream(A);
ss2 =std::istringstream(B);
int a,b;
ss1 >> a;
ss2 >> b;
if (op == "+"){
cout << a + b << endl;
}else{
cout << a - b << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A = 0, B = 0;
char op = 0;
cin >> A >> op >> B;
int ans = 0;
if (op == '+') {
ans = A+B;
} else {
ans = A-B;
}
cout << ans << endl;
} | 1 | 28,895,655 |
#include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void a_candy_easy(void) {
int n;
cin >> n;
int sum = 0;
for (int i = 1; i <= n; i++) sum += i;
cout << sum << endl;
}
int main()
{
a_candy_easy();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll n; cin >> n;
cout << n * (n+1) / 2 << endl;
} | 1 | 22,865,828 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define all(v) v.begin(), v.end()
#define INF 1000000000
#define mod 1000000007
using namespace std;
using ll = long long;
using vi = vector<int>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vc = vector<char>;
using vs = vector<string>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvc = vector<vc>;
using vvs = vector<vs>;
using vvb = vector<vb>;
int main() {
int n, k; cin >> n >> k;
vi p(n); rep(i, n) cin >> p[i];
sort(all(p));
int cost = 0;
rep(i, k) {
cost += p[i];
}
cout << cost << endl;
} | #include <stdio.h>
#include <string.h>
int input[1001];
int q_sort(int start, int end){
if(end == start) return 0; else{
int p = start;
for(int i = (start + 1); i < end + 1; i++){
if(input[i] < input[p]){
int temp = input[i];
memmove(input + start + 1, input + start, (i - start)*sizeof(int));
input[start] = temp;
p++;
}
}
if(start != p) q_sort(start,p-1);
if(end != p) q_sort(p+1,end);
return 0;
}
}
int main(){
int a, b, c, d;
scanf("%d%d", &a, &b);
c = 0;
for(int i = 0; i < a; i++){
scanf("%d", &input[i]);
}
q_sort(0,a-1);
for(int i = 0; i < b; i++){
c = c + input[i];
}
printf("%d",c);
return 0;
} | 1 | 64,218,235 |
#include <iostream>
using namespace std;
typedef long long ll;
const ll N=1e9;
int n,m;
ll sum;
int main()
{
scanf("%d%d%lld",&n,&m,&sum);
int f=0,flag=0;
while(f<n)
{
if(f<m)
{
printf("%lld ",sum);
}
else
{
if(sum!=N)
printf("%lld ",sum+1);
else
printf("%lld ",sum-1);
}
f++;
}
printf("\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k, s;
cin >> n >> k >> s;
for (int i = 0; i < k; i++) {
if (i == 0)cout << s;
else cout << " " << s;
}
for (int i = 0; i < n - k; i++) {
if (s == 1000000000)cout << " " << 99999999;
else cout << " " << 1000000000;
}
} | 1 | 1,255,084 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int> COST;
#define repl(i,n) for(ll i=0;i<(n);++i)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
using Graf=vector<vector<int>>;
#define MAX 100000
int main()
{
ll l,r;
cin >> l >> r;
int mod_l=l%2019;
int mod_r=r%2019;
if(mod_r<=mod_l){
cout << 0 << endl;
}else{
if(l+2019<r){
cout << 0 << endl;
}else{
int min=MAX;
for(int i=mod_l;i<mod_r;++i){
for(int j=i+1;j<=mod_r;++j){
if((i*j)%2019<min){
min=(i*j)%2019;
}
}
}
cout << min << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int l,r,MOD=2019,min=50000000000,i,j;
cin >> l >> r;
for(i=l;i<r;i++)
{
for(j=i+1;j<=r;j++)
{
if(min>(i%MOD)*(j%MOD)%MOD)
{
min=(i%MOD)*(j%MOD)%MOD;
}
if(min==0)
{
cout << min << endl;
return 0;
break;
}
}
}
cout << min << endl;
return 0;
} | 1 | 25,501,118 |
#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define int long long
#define double long double
using namespace std;
const int N = 500777;
int n, t, x, k;
int a[N];
int suf[N];
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i <= n; i++){
cin >> a[i];
}
for (int i = n; i >= 0; i--){
suf[i] = suf[i + 1] + a[i];
}
int cur = 1;
int sum = 0;
if (a[0] > 1){
cout << -1 << endl;
return 0;
}
for (int i = 0; i < n; i++){
sum += cur;
if (a[i] >= cur){
cout << -1 << endl;
return 0;
}
cur -= a[i];
if (cur > suf[i + 1]){
cout << -1 << endl;
return 0;
}
cur = min(suf[i + 1], cur *= 2);
}
sum += cur;
if (cur < a[n]){
cout << -1 << endl;
return 0;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int A[101010];
ll L[101010], R[1010101];
int main() {
int n;
cin >> n;
rep(i,n+1) cin >> A[i];
L[n] = R[n] = A[n];
for(int i = n-1; i >= 0; --i){
L[i] = A[i] + (L[i+1]+1)/2;
R[i] = A[i] + R[i+1];
}
if(L[0]>1) {cout << -1 << endl; return 0;}
ll now = 1;
ll ans = 0;
rep(i,n+1) {
ans += now;
now-=A[i];
now = min(now*2, R[i+1]);
}
cout << ans << endl;
return 0;
} | 1 | 3,272,283 |
#include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
#define endl "\n"
#define mod 1000000007
#define mod2 998244353
#define double long double
#define pb push_back
#define swap(x,y) (x^=y^=x^=y)
#define TC int TESTCASE;cin>>TESTCASE;while(TESTCASE--)
#define oo 1500000000000000000
#define mem(a,b) memset(a,b,sizeof(a))
#define debug1(a) cout<<#a<<" = "<<(a)<<endl;
#define debug2(a,b) cout<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<endl;
#define debug3(a,b,c) cout<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<", "<<#c<<" = "<<(c)<<endl;
#define debug4(a,b,c,d) cout<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<", "<<#c<<" = "<<(c)<<", "<<#d<<" = "<<(d)<<endl;
using namespace std;
int modexpo(int x,int p){
int res = 1;x = x%mod;
while(p){
if(p%2)res = res * x;
p >>= 1;
x = x*x % mod;
res %= mod;
}
return res;
}
int max(int a,int b){return (a>b?a:b);}
int min(int a,int b){return (a<b?a:b);}
struct edge{int u,v,w;edge(int a,int b,int c){u=a;v=b;w=c;}};
struct compare{
bool operator() (const edge a, const edge b) const{
if(a.u == b.u){
if(a.v == b.v){
return a.w < b.w;
}
return a.v < b.v;
}
return a.u < b.u;
}
};
int32_t main(){
IOS
int a,b;
cin >> a >> b;
int lcm = a*b;
lcm /= __gcd(a,b);
cout<<lcm<<endl;
} | #include <iostream>
using namespace std;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
int main() {
long long A, B;
cin >> A >> B;
cout << A / GCD(A, B) * B << endl;
} | 1 | 24,678,183 |
#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;
}
}
for (auto i = 0u; i < n; ++i) {
const char* sep = "";
for (auto j = 0u; j < n; ++j) {
std::printf("%s%d", sep, g[i][j]);
sep = " ";
}
std::printf("\n");
}
} | #include <iostream>
#include <vector>
namespace
{
void OutputRow(int Length, std::vector<int>::const_iterator Begin, std::vector<int>::const_iterator End)
{
std::vector<int>::const_iterator It = Begin;
for(int i = 1; i < Length; ++i){
if(It == End || i < *It){
std::cout << 0;
}else{
std::cout << 1;
++It;
}
if(i < Length - 1){
std::cout << " ";
}else{
std::cout << std::endl;
}
}
}
}
class TGraph
{
std::vector<std::vector<int> > FNodes;
public:
TGraph(int Count);
void InputNodes(int Index, int BranchCount);
void OutputAdjacencyMatrix()const;
};
TGraph::TGraph(int Count)
:FNodes(Count + 1)
{
}
void TGraph::InputNodes(int Index, int BranchCount)
{
for(int i = 0; i < BranchCount; ++i){
int Target;
std::cin >> Target;
FNodes[Index].push_back(Target);
}
}
void TGraph::OutputAdjacencyMatrix()const
{
for(unsigned int i = 1; i < FNodes.size(); ++i){
OutputRow(FNodes.size(), FNodes[i].begin(), FNodes[i].end());
}
}
int main()
{
int Count;
std::cin >> Count;
TGraph Graph(Count);
for(int i = 0; i < Count; ++i){
int Index;
std::cin >> Index;
int BranchCount;
std::cin >> BranchCount;
Graph.InputNodes(Index, BranchCount);
}
Graph.OutputAdjacencyMatrix();
return 0;
} | 1 | 35,059,404 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define deb(name,value) cout <<"->> "<<name<< "= " <<value<<" "
#define frepi(a,b,k) for(int i=a;i<=b;i+=k)
#define frepj(a,b,k) for(int j=a;j<=b;j+=k)
void solve_main()
{
ll n,a,b;cin>>n>>a>>b;
ll ans = 0;
if(n%(a+b)==0)
{
cout<<a*(n/(a+b));
}
else
{
ans+=(n/(a+b))*(a);
if(n%(a+b)>=a)
{
ans+=a;
}
else
ans+=(n%(a+b));
cout<<ans;
}
}
int main()
{
int t=1;
while(t--)
{
solve_main();
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> SETI;
const int mxN = 2e5;
const ld pi = 4.0 * atanl(1.0);
const int iinf = 1e9 + 10;
const int inf = 1e18 + iinf + 10;
const int mod = 1000000007;
const ld prec = .000001;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(c) c.begin(), c.end()
#define rall(c) c.end(), c.begin()
ll n, m, t, a[mxN];
vi v;
void fast() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); }
int main() {
fast();
ll a, b;
cin >> n >> a >> b;
cout << n / (a + b) * a + min(a, n % (a + b));
return 0;
} | 1 | 89,378,625 |
#include <cstdio>
#include <iostream>
#include <queue>
#include <map>
#include <string>
using namespace std;
typedef struct P{
int x;
int y;
}P;
int h,w,n;
const int INF = 100000000;
char feld[1010][1010];
P ch[15];
int d[1010][1010];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int sx,sy;
int gx,gy;
int ans=0;
int bfs(){
for(int i=0;i<n;i++){
P s_xy=ch[i];
sx=ch[i].x;
sy=ch[i].y;
gx=ch[i+1].x;
gy=ch[i+1].y;
for(int y=0;y<h;y++)
for(int x=0;x<w;x++)
d[y][x]=INF;
queue<P> que;
que.push(s_xy);
d[sy][sx]=0;
while(!que.empty()){
P p=que.front();
que.pop();
int x=p.x;
int y=p.y;
if(x==gx&&y==gy){
ans+=d[gy][gx];
break;
}
for(int i=0;i<4;i++){
int nx=x+dx[i];
int ny=y+dy[i];
if(nx<0||nx>=w||ny<0||ny>=h)continue;
if(feld[ny][nx]!='X'&&d[ny][nx]==INF){
P n;
n.x=nx;
n.y=ny;
d[ny][nx]=d[y][x]+1;
que.push(n);
}
}
}
}
return 0;
}
int main(){
cin>>h>>w>>n;
char c;
for(int y=0;y<h;y++){
for(int x=0;x<w;x++){
scanf(" %c",&feld[y][x]);
c=feld[y][x];
if(feld[y][x]=='S'){
ch[0].x=x;
ch[0].y=y;
}
if(c>='1'&&c<='9'){
ch[c-'0'].x=x;
ch[c-'0'].y=y;
}
}
}
bfs();
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vec;
typedef vector<vec> mat;
typedef pair<int,int> P;
int main() {
int H, W, N;
cin >> H >> W >> N;
vector<string> fd(H);
for (auto& i : fd) cin >> i;
vec objx(N+1), objy(N+1);
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (fd[i][j] == 'S') objx[0] = i, objy[0] = j;
else if ('0' <= fd[i][j] && fd[i][j] <= '9') {
int num = fd[i][j] - '0';
objx[num] = i;
objy[num] = j;
}
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
queue<P> que;
que.push(P(objx[i], objy[i]));
int INF = 1<<28;
int dx[] = {0,1,-1,0};
int dy[] = {1,0,0,-1};
mat dp(H, vec(W, INF));
dp[objx[i]][objy[i]] = 0;
while (que.size()) {
P p = que.front(); que.pop();
int x = p.first;
int y = p.second;
for (int j = 0; j < 4; j++) {
int nx = x + dx[j];
int ny = y + dy[j];
if (0 <= nx && nx < H && 0 <= ny && ny < W && fd[nx][ny] != 'X') {
if (dp[nx][ny] > dp[x][y] + 1) {
dp[nx][ny] = dp[x][y] + 1;
que.push(P(nx,ny));
}
}
}
}
ans += dp[objx[i+1]][objy[i+1]];
}
cout << ans << endl;
return 0;
} | 1 | 11,531,331 |
#include<iostream>
#include<algorithm>
#define N 5
using namespace std;
void output_array_int(int*,int,char);
void input_array_int(int*,int);
int main(){
int W,H,x,y,r;
cin>>W>>H>>x>>y>>r;
if(W>=x+r&&x-r>=0&&H>=y+r&&y-r>=0){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return 0;
}
void output_array_int(int * a,int n,char ch){
int i;
for(i=0;i<n;i++){
cout<<*(a+i);
if(i<(n-1)){
cout<<ch;
}
}
cout<<endl;
return;
}
void input_array_int(int *a,int n){
int i;
for(i=0;i<n;i++){
cin>>*(a+i);
}
} | #include<stdio.h>
int main(void)
{
int W,H,x,y,r,f;
scanf("%d %d %d %d %d",&W,&H,&x,&y,&r);
f=0;
if(x+r>W)f=1;
if(y+r>H)f=1;
if(r>x)f=1;
if(r>y)f=1;
if(f==0) {
printf("Yes\n");
}
else {
printf("No\n");
}
return 0;
} | 1 | 52,952,164 |
#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()
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> n(4), x{1, 4, 7, 9};
rep(i, 4) cin >> n.at(i);
sort(all(n));
cout << (n == x ? "YES" : "NO") << endl;
return 0;
} | #include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <stack>
#include <bitset>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
ll(s); \
cin >> (s);
#define Scin(s) \
ll(s); \
cin >> (s);
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)
{
a = b;
return 1;
}
return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
ll MOD = 1e9 + 7;
ll INF = 1e18;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
V vec(4);
rep(i,4)cin>>vec[i];
sort(all(vec));
if(vec[0]==1&&vec[1]==4&&vec[2]==7&&vec[3]==9){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
} | 1 | 9,686,595 |
#include<bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using ll=long long;
#define inf 1e16
#define MAX 100005
#define mod 998244353
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld",&a,&b)
#define sfff(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define Case(i) printf("Case %lld: ",i)
#define setpre(number) cout<<fixed<<setprecision(10)<<number<<endl
#define pf(a) printf("%lld ",a)
#define pff(a,b) printf("%lld %lld\n",a,b)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define FOR1(i,n) for(ll i=1;i<=n;i++)
#define LOOP(x,y) for(ll i=x;i<=y;i++)
#define RFOR(i,n) for(ll i=n-1;i>=0;i--)
#define RFOR1(i,n) for(ll i=n;i>0;i--)
#define RLOOP(x,y) for(ll i=y;i>=x;i--)
#define m_p make_pair
#define ff first
#define ss second
#define p_b push_back
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL)
#define output freopen("output.txt","w",stdout)
map<ll,ll>mp1,mp;
vector<pair<ll,pair<ll,ll> > >vpp1;
vector<pair<ll,ll> >v,vpp,vp1;
vector<ll>v1,v2,fin;
map<pair<ll,ll>,bool>mbb;
map<ll,bool>mb,mb1;
ll a,b,c,n,d,e,f,ta,sum=0,cnt=0,m,l,req,sz,maxi,k;
priority_queue<ll>pq;
string str;
ll table[6100+10][6100+10];
ll arr[100+10];
void calc()
{
memset(arr,0,sizeof arr);
arr[3]=1;
arr[4]=2;
for(ll i=5; i<=100; i++)
{
if(i%2==1)
arr[i]=arr[i-1]+2;
else
arr[i]=arr[i-1]+1;
}
}
int main()
{
fast;
cin>>n>>k;
for(ll i=2; i<=n; i++)
{
v.p_b({1LL,i});
}
ll x=n-2;
ll tot=((x)*(x+1))/2;
if(k>tot)
{
cout<<-1<<endl;
return 0;
}
for(ll i=2; i<n; i++)
{
for(ll j=i+1; j<=n; j++)
{
if(tot!=k)
{
v.p_b({i,j});
tot--;
}
}
}
ll l=v.size();
cout<<l<<endl;
for(ll i=0; i<l; i++)
cout<<v[i].ff<<" "<<v[i].ss<<endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
int main()
{
int N, K;
cin >> N >> K;
if (K > (N - 1) * (N - 2) / 2)
{
cout << -1 << endl;
return 0;
}
int rem = (N - 1) * (N - 2) / 2 - K;
cout << N - 1 + rem << endl;
for (int i = 2; i <= N; ++i)
{
cout << 1 << ' ' << i << endl;
}
for (int i = 2; i <= N; ++i)
{
if (rem == 0) break;
for (int j = i + 1; j <= N; ++j)
{
cout << i << ' ' << j << endl;
--rem;
if (rem == 0) break;
}
}
} | 1 | 38,300,387 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<cmath>
using namespace std;
void koch_curve(const int n, const pair<double, double>& begin, const pair<double, double>& end){
if(n == 0){
return;
}
pair<double, double> p1, p2, p3;
p1.first = (2.0 * begin.first + end.first) / 3;
p1.second = (2.0 * begin.second + end.second) / 3;
p3.first = (begin.first + 2.0 * end.first) / 3;
p3.second = (begin.second + 2.0 * end.second) / 3;
p2.first = (p3.first - p1.first) * cos(M_PI / 3) - (p3.second - p1.second) * sin(M_PI / 3) + p1.first;
p2.second = (p3.first - p1.first) * sin(M_PI / 3) + (p3.second - p1.second) * cos(M_PI / 3) + p1.second;
koch_curve(n - 1, begin, p1);
cout << p1.first << " " << p1.second << endl;
koch_curve(n - 1, p1, p2);
cout << p2.first << " " << p2.second << endl;
koch_curve(n - 1, p2, p3);
cout << p3.first << " " << p3.second << endl;
koch_curve(n - 1, p3, end);
}
int main(){
int n;
cin >> n;
cout << fixed << setprecision(10);
pair<double, double> begin = {0.0, 0.0};
pair<double, double> end = {100.0, 0.0};
cout << begin.first << " " << begin.second << endl;
koch_curve(n, begin, end);
cout << end.first << " " << end.second << endl;
return 0;
} | #include<stdio.h>
#include<iostream>
#include<math.h>
using namespace std;
const double PI = 3.1415926535;
const double th = 60 * PI / 180;
class p
{
public:
double x;
double y;
void print();
};
void p::print()
{
printf("%.8f %.8f\n", x, y);
}
void koch(int d, p p1, p p2)
{
if (d == 0)return;
p s, u, t;
s.x = (2 * p1.x + p2.x) / 3;
s.y = (2 * p1.y + p2.y) / 3;
t.x = (p1.x + 2 * p2.x) / 3;
t.y = (p1.y + 2 * p2.y) / 3;
u.x = (t.x - s.x)*cos(th) - (t.y - s.y)*sin(th) + s.x;
u.y = (t.x - s.x)*sin(th) + (t.y - s.y)*cos(th) + s.y;
koch(d - 1, p1, s);
s.print();
koch(d - 1, s, u);
u.print();
koch(d - 1, u, t);
t.print();
koch(d - 1, t, p2);
}
int main()
{
int d;
p f, l;
cin >> d;
f.x = f.y = l.y = 0;
l.x = 100;
f.print();
koch(d, f, l);
l.print();
return 0;
} | 1 | 4,343,112 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
struct union_find{
vector<int> par;
vector<int> rank;
vector<int> siz;
union_find(int N) : par(N), rank(N), siz(N){
rep(i,N){
par[i] = i;
rank[i] = 0;
siz[i] = 1;
}
}
int root(int x){
if (par[x] == x){
return x;
}
return par[x] = root(par[x]);
}
void unite(int x, int y){
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
if (rank[rx] < rank[ry]){
par[rx] = ry;
siz[ry] += siz[rx];
}
else{
par[ry] = rx;
siz[rx] += siz[ry];
if (rank[rx] == rank[ry]) rank[rx]++;
}
}
bool same(int x, int y){
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size(int x){
return siz[root(x)];
}
};
int main(){
int N,M;
cin >> N >> M;
vector<int> vec(N);
rep(i,N){
cin >> vec[i];
}
vector<int> detect(N);
rep(i,N){
detect[vec[i] - 1] = i;
}
union_find tree(N);
rep(i,M){
int x,y;
cin >> x >> y;
x--;
y--;
tree.unite(x,y);
}
int ans = 0;
rep(i,N){
if (tree.same(detect[i], i)) ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int n, m;
vector <int> v, adj[N];
set <int> p[N];
bool mark[N];
void dfs(int u, int k) {
mark[u] = true;
p[k].insert(u);
for (auto x: adj[u])
if (!mark[x])
dfs(x, k);
}
int main() {
ios_base :: sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
a--;
v.push_back(a);
}
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
adj[v].push_back(u);
adj[u].push_back(v);
}
for (int i = 0; i < n; i++)
if (!mark[i])
dfs(i, i);
int ans = 0;
for (int i = 0; i < n; i++) {
int si = p[i].size();
vector <int> l;
for (auto x: p[i])
l.push_back(v[x]);
for (int j = 0; j < l.size(); j++)
p[i].erase(l[j]);
ans += si - p[i].size();
}
cout << ans;
return 0;
} | 1 | 16,086,571 |
#include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
#define MAX_N 10000
using namespace std;
typedef pair<int, int> P;
typedef long long int ll;
const int INF = 1<<30;
const ll MOD = ll(1e9+7);
int main(){
string s, t;cin>>s>>t;
cout<<(s==t.substr(0, t.size()-1)?"Yes":"No")<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
string s, t;
cin >> s >> t;
t.pop_back();
cout << (s == t? "Yes" : "No") << endl;
return 0;
} | 1 | 35,832,833 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int x, n;
cin >> x >> n;
vector<int> a(n);
map<int,int> m;
for (int& y: a) {
cin >> y;
++m[y-x];
}
for (int i = 0; i < n; ++i) {
if (m.find(-i) == m.end()) {
cout << -i + x << endl;
return 0;
}
else if (m.find(i) == m.end()) {
cout << i + x << endl;
return 0;
}
}
cout << -n + x << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int X, N;
cin >> X >> N;
vector<int> p(N);
rep(i, N) cin >> p[i];
if (N == 0) {
cout << X << endl;
return 0;
}
for (int i = 0; i <= N; i++) {
auto it2 = find(p.begin(), p.end(), X - i);
if (it2 == p.end()) {
cout << X - i << endl;
return 0;
}
auto it3 = find(p.begin(), p.end(), X + i);
if (it3 == p.end()) {
cout << X + i << endl;
return 0;
}
}
return 0;
} | 1 | 61,438,311 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
long long d[N];
vector<pair<int,int>> adj[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for(int i = 0; i < n-1; i++) {
int a, b, c;
cin >> a >> b >> c;
a--;
b--;
adj[a].push_back(make_pair(b, c));
adj[b].push_back(make_pair(a, c));
}
int q, k;
cin >> q >> k;
k--;
for(int i = 0; i < n; i++) d[i] = 1e16;
d[k] = 0;
priority_queue<pair<long long, int>> pq;
pq.push(make_pair(0, k));
while(!pq.empty()) {
int now = pq.top().second;
pq.pop();
for(pair<int,int> pv : adj[now]) {
if(d[pv.first] > d[now] + pv.second) {
d[pv.first] = d[now] + pv.second;
pq.push(make_pair(-d[pv.first], pv.first));
}
}
}
for(int i = 0; i < q; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
cout << d[u]+d[v] << "\n";
}
return 0;
} | #include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(prime, true, sizeof(prime));
for (int p=2; p*p<=n; p++)
{
if (prime[p] == true)
{
for (int i=p*p; i<=n; i += p)
prime[i] = false;
}
}
for (int p=2; p<=n; p++)
if (prime[p])
primes.push_back(p);
}
ll max(ll a,ll b)
{
if(a>b)
return a;
return b;
}
ll power(ll x, ll y,ll mod)
{
ll temp;
if( y == 0)
return 1;
temp = power(x, y/2,mod);
if (y%2 == 0)
return (temp*temp)%mod;
else
return (((x*temp)%mod)*temp)%mod;
}
ll binomialCoeff(ll n, ll k)
{
ll C[k+1];
memset(C, 0, sizeof(C));
C[0] = 1;
for (ll i = 1; i <= n; i++)
{
for (ll j = min(i, k); j > 0; j--)
C[j] = C[j] + C[j-1];
}
return C[k];
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n=nxt();
vector <vector <pair<int,int> > > g;
vector <pair<int,int> > r1;
g.resize(n+1,r1);
for(int i=0;i<n-1;i++)
{
int u=nxt(),v=nxt(),c=nxt();
g[u].push_back({v,c});
g[v].push_back({u,c});
}
vector<bool> visited;
visited.resize(n+1,0);
vector <ll> dist(n+1);
int Q=nxt(),k=nxt();
dist[k]=0;
visited[k]=1;
queue <int> q;
q.push(k);
while(q.size())
{
int x=q.front();
q.pop();
for(auto i:g[x])
{
if(!visited[i.first])
{
visited[i.first]=1;
q.push(i.first);
dist[i.first]=dist[x]+i.second;
}
}
}
while(Q--)
{
int x=nxt(),y=nxt();
cout<<dist[x]+dist[y]<<"\n";
}
return 0;
} | 1 | 21,220,393 |
#include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define sz(c) ((int)(c).size())
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
const int MAX=2e5+5;
int main(){
int N;
cin>>N;
int k=-1;
rep1(i,500){
if((i*(i-1))/2==N)k=i;
}
if(k==-1)cout<<"No"<<endl;
else{
cout<<"Yes"<<endl;
cout<<k<<endl;
vi S[500];
int ind=1;
rep(i,k)rep(j,k)if(i<j){
S[i].push_back(ind);
S[j].push_back(ind);
ind++;
}
rep(i,k){
cout<<sz(S[i])<<" ";
rep(j,sz(S[i]))cout<<S[i][j]<<" ";
cout<<endl;
}
}
} | #include <iostream>
#include <string>
#include <array>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#define FOR(i, a, b) for(decltype(b) i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
using namespace std;
#ifdef INPUT
#include <sstream>
stringstream input(R"(
6
)");
#define cin input
#endif
int main()
{
int n;
cin >> n;
int k = sqrt((long double)n * 2) + 1;
if (k * (k - 1) / 2 == n)
{
cout << "Yes" << endl;
cout << k << endl;
REP (i, k)
{
cout << k - 1;
int x = i * (i - 1) / 2;
REP (j, i)
cout << ' ' << ++x;
++x;
FOR (j, i, k - 1)
cout << ' ' << (x += j);
cout << endl;
}
} else
cout << "No" << endl;
return 0;
} | 1 | 94,376,898 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int p,q,r;
vector<int> a(3);
rep(i,3){
cin >> a.at(i);
}
sort(a.begin(),a.end());
cout << a.at(0) + a.at(1) << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
vector <int> vec(3);
scanf("%d %d %d", &vec[0], &vec[1], &vec[2]);
sort(vec.begin(), vec.end());
printf("%d\n", vec[0] + vec[1]);
return 0;
} | 1 | 98,797,293 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); }
bool isPrime(ll n){
if (n == 2 || n == 3 || n == 5)
return true;
else if (n % 2 == 0 || n % 3 == 0 || n % 5 == 0 || n == 1)
return false;
else {
for (int i = 5; i <= sqrt(n); i += 2){
if (n%i == 0)
return false;
}
return true;
}
}
int frq[123];
int main(){
Lancer();
ll t, a, b, res = 0;
cin >> t;
while (t--)
{
cin >> a >> b;
res += ((b - a) + 1);
}
cout << res;
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(),(a).end()
const ll INF = 1e18+18;
const ll MAX = 200000;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
static const long double pi = 3.141592653589793;
int main(){
ll N;
cin>>N;
ll Ans=0;
rep(i, N){
ll l, r;
cin>>l>>r;
Ans+=(r-l+1);
}
cout<<Ans<<endl;
} | 1 | 85,941,861 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
ll A[N],B[N];
ll num = 0;
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
for (int i = N-1; i >= 0; i--) {
num += (B[i] - ((num + A[i]) % B[i])) % B[i];
}
cout << num << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
rep(i,n) cin >> a.at(i) >> b.at(i);
ll ans=0;
rep(i,n){
int j = n-1-i;
int r = (a.at(j)+ans)%b.at(j);
if(r!=0) ans += b.at(j)-r;
}
cout << ans;
} | 1 | 39,619,723 |
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ld long double
#define pb push_back
#define f first
#define se second
using namespace std;
const int N = 5e5 + 123;
ll m, k, pw[30];
bool is[N];
vector <ll> a, b;
int main() {
cin >> m >> k;
ll t = 1;
for (ll i = 0; i <= 20; i++) {
pw[i] = t;
t *= 2;
}
if (k > pw[m] - 1)
return cout << -1, 0;
if (m == 0)
return cout << "0 0", 0;
if (m == 1 && k == 0)
return cout << "0 0 1 1", 0;
if (m == 1)
return cout << -1, 0;
if (k == 0) {
for (int i = 0; i < pw[m]; i++)
cout << i << " ";
for (int i = pw[m] - 1; i >= 0; i--)
cout << i << " ";
return 0;
}
bool iss = 0;
for (int i = 0; i < 20; i++)
if (k == pw[i]) {
if (k != 1) {
b.pb(pw[i] + 1);
b.pb(1);
iss = 1;
is[1] = is[pw[i] + 1] = 1;
} else {
b.pb(pw[1]);
b.pb(pw[1] + 1);
iss = 1;
is[pw[1]] = is[pw[1] + 1] = 1;
}
break;
}
if (!iss) {
for (int i = 0; i < 20; i++)
if (1 & (k>>i)) {
is[pw[i]] = 1;
b.pb(pw[i]);
}
}
is[k] = 1;
for (int i = 0; i < b.size(); i++)
a.pb(b[i]);
for (int i = 0; i < pw[m]; i++)
if (!is[i])
a.pb(i);
a.pb(k);
for (int i = pw[m] - 1; i >= 0; i--)
if (!is[i])
a.pb(i);
for (int i = b.size() - 1; i >= 0; i--)
a.pb(b[i]);
a.pb(k);
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
return 0;
} | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef long long ll;
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i, s) for (int(i) = (s) - 1; (i) >= 0; --(i))
#define all(x) x.begin(),x.end()
#pragma region UnionFind
struct UnionFind
{
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x)
{
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y)
{
return root(x) == root(y);
}
bool merge(int x, int y)
{
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x)
{
return -par[root(x)];
}
};
#pragma endregion
#pragma region GCD
int gcd(int a, int b)
{
if (a%b == 0)return b;
return gcd(b, a%b);
}
#pragma endregion
#pragma region chmin
template<class T> inline bool chmin(T& a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma region chmax
template<class T> inline bool chmax(T& a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma endregion
int main()
{
int m, k; cin >> m >> k;
if (pow(2, m) <= k)cout << -1 << endl;
else if (m == 0)cout << "0 0" << endl;
else if (m == 1)
{
if (k == 0)cout << "0 1 1 0" << endl;
else cout << -1 << endl;
}
else
{
rep(i, pow(2, m))
{
if (i == k)continue;
cout << i << " ";
}
cout << k << " ";
rrep(i, pow(2, m))
{
if (i == k)continue;
cout << i << " ";
}
cout << k;
}
} | 1 | 51,436,169 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
set<ll> s;
ll a;
rep(i,n) {
cin >> a;
if (s.find(a) != s.end()) {
cout << "NO" << endl;
return 0;
}
s.insert(a);
}
cout << "YES" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int n;
cin >> n;
set<int> st;
rep(i,n){
int a;
cin >> a;
st.insert(a);
}
if(st.size()!=n){
cout << "NO" << endl;
}
else cout << "YES" << endl;
return 0;
} | 1 | 71,334,492 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#define all(x) x.begin(), x.end()
#ifdef _DEBUG
#define dd(x) cout << #x << " : " << x << endl
#else
#define dd(x)
#endif
using namespace std;
using ll = int64_t;
int main(){
int n, k; cin >> n >> k;
vector<int> p;
rep(i, n) {
int tmp; cin >> tmp;
p.push_back(tmp);
}
sort(all(p));
int ans = 0;
rep(i, k) ans += p[i];
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <list>
using namespace std;
const int N = 105;
int main() {
int n, t;
cin >> n >> t;
list<int> L;
list<int>::iterator it, min;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
L.push_back(x);
}
vector<int>v;
while (v.size() != t)
{
min = L.begin();
for (it = L.begin(); it != L.end(); it++) {
if (*it <= *min)
min = it;
}
v.push_back(*min);
L.erase(min);
}
int sum = 0;
for (int i = 0; i < v.size(); i++)
{
sum += v[i];
}
cout << sum << endl;
return 0;
} | 1 | 5,911,253 |
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string>
using namespace std;
int main(){
int n;
int i,j,k;
int era;
while(cin >> n){
int count = 0;
int S[n+1];
for(i=2 ; i<n+1 ; i++){
S[i] = i;
}
for(i=2 ; i<(
(int)sqrt(n)+1) ; i++){
if(S[i] != 0){
era = S[i];
for(j=2 ; (j*era)<(n+1) ; j++){
S[j*era] = 0;
}
}
}
for(i=2 ; i<n+1 ; i++){
if(S[i] != 0){
count++;
}
}
cout << count << endl;
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
int eratos(int n){
bool isprime[n + 1];
for(int i = 0; i <= n; i++)isprime[i] = true;
isprime[0] = isprime[1] = false;
for(int i = 2; i * i <= n; i++){
if(isprime[i]){
int j = i + i;
while(j <= n){
isprime[j] = false;
j = j + i;
}
}
}
int counter = 0;
for(int i = 0; i <= n; i++){
if(isprime[i] == true)counter++;
}
return counter;
}
int main(){
int n;
while(cin >> n){
cout << eratos(n) << endl;
}
} | 1 | 71,104,782 |
#include <bits/stdc++.h>
using namespace std;
#define long long long
#define INF ((long) 2e18)
#define MOD ((long) (1e9 + 7))
#define umap unordered_map
int main()
{
ios::sync_with_stdio(true); cin.tie(0); cout.tie(0);
long t = 1;
while (t--) {
long n, a, b;
cin >> n >> a >> b;
long ans = n / (a + b);
long aux = ans * (a + b);
long r = n - aux;
ans *= a;
ans += min(a, r);
printf("%lld\n", ans);
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
long long t = n / (a + b);
long long last = n % (a + b);
long long exb = last;
if (exb > a) exb = a;
cout << t * a + exb << endl;
} | 1 | 16,880,257 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
ll gcd(ll a,ll b)
{
if(a%b==0)
{
return(b);
}
else
{
return(gcd(b,a%b));
}
}
ll lcm(ll a,ll b)
{
return a/gcd(a,b)*b;
}
int main()
{
ll A,B,C,D; cin>>C>>D>>A>>B;
ll kosuA_C=(C-1)/A;
ll kosuA_D=D/A;
ll kosuB_C=(C-1)/B;
ll kosuB_D=D/B;
ll kosuAB_C=(C-1)/(lcm(A,B));
ll kosuAB_D=D/(lcm(A,B));
cout<<(D-C+1)-((kosuA_D-kosuA_C)+(kosuB_D-kosuB_C)-(kosuAB_D-kosuAB_C))<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i < n; i++)
using P = pair<ll, ll>;
ll gcd(ll m, ll n)
{
if (m < n)
{
ll tmp = m;
m = n;
n = tmp;
}
while (1)
{
ll mod = m % n;
if (mod == 0)
return n;
m = n;
n = mod;
}
}
ll lcm(ll m, ll n)
{
return m * n / gcd(m, n);
}
int main()
{
ll a, b, c, d, ans;
cin >> a >> b >> c >> d;
a--;
ans = b - a;
b = b / c + b / d - b / lcm(c, d);
a = a / c + a / d - a / lcm(c, d);
ans-=b-a;
cout<<ans<<endl;
return 0;
} | 1 | 60,588,899 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (ll i = ((ll)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll R,G,B,N;
string S;
cin >> R>>G>>B>>N;
ll tmp;
ll ans = 0;
REP(i, N / R+1)
{
REP(j,N/G+1){
tmp = N - R * i - G * j;
if(tmp>=0&&tmp%B==0){
ans++;
}
}
}
cout << ans << endl;
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
using namespace std;
typedef long long ll;
typedef long double ld;
int const INF=1001001001;
ll const LINF=1001001001001001001;
ll const MOD=1000000007;
int R,G,B,N;
int main(){
cin>>R>>G>>B>>N;
int ans=0;
rep(r,3001){
int x=R*r;
if(x>N) break;
rep(g,3001){
int y=G*g;
if(x+y>N) break;
if((N-x-y)%B==0) ans++;
}
}
cout<<ans<<endl;
} | 1 | 31,742,443 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<class A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}cout << "\n";}
ld PI=3.14159265358979323846;
int main(){
ll N, M;
cin >> N >> M;
vector<ll> A(N), B(N);
vector<vector<ll>> v(M+1);
priority_queue<ll> que;
rep(i,N){
cin >> A[i] >> B[i];
if(A[i] > M) continue;
v[A[i]].push_back(B[i]);
}
ll ans = 0;
rep(i,M){
ll d = i+1;
for(auto& u:v[d]){
que.push(u);
}
if(que.empty())continue;
ll t = que.top();
que.pop();
ans += t;
}
cout << ans << endl;
} | #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> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
int main() {
int N,M;cin>>N>>M;
vector<priority_queue<int>> tbl(100010);
rep(i,N) {
int a,b;cin>>a>>b;
tbl[a].push(b);
}
ll ans = 0;
priority_queue<P> pq;
for(int i = 1;i<M+1;i++) {
if(tbl[i].size()!=0) {
int val = tbl[i].top();
tbl[i].pop();
pq.push(P(val,i));
}
if(!pq.empty()) {
int val = pq.top().first;
int day = pq.top().second;
pq.pop();
ans += val;
if(tbl[day].size()!=0) {
int val = tbl[day].top();
tbl[day].pop();
pq.push(P(val,day));
}
}
}
cout<<ans<<endl;
} | 1 | 10,114,120 |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long N;
cin >> N;
long ans = 100000000;
double d = sqrt(N) + 1;
for (long i = 1; i < d ; i++) {
long a = i;
if (N % a != 0){
continue;
}
long b = N / a;
string s_a = to_string(a);
int k_a = s_a.size();
string s_b = to_string(b);
int k_b = s_b.size();
int m = max(k_a, k_b);
if (ans > m){
ans = m;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int digitcnt(long long a){
int cnt=0;
while(a>0){
a/=10;
cnt++;
}
return cnt;
}
int main(){
long long n, i, b, ans=10000000;
cin >> n;
for(i=1;i<=sqrt(n);i++){
long long f, digcnta, digcntb;
if(n%i==0){
b=n/i;
digcnta=digitcnt(i);
digcntb=digitcnt(b);
f=max(digcnta, digcntb);
ans=min(ans, f);
}
}
cout << ans <<endl;
return 0;
} | 1 | 65,212,697 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
static const int N = 1000;
int main()
{
int n, p[N + 1];
vector<vector<int>> m(N + 1, vector<int>(N + 1));
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> p[i - 1] >> p[i];
}
for (int i = 1; i <= n; i++)
{
m.at(i).at(i) = 0;
}
for (int l = 2; l <= n; l++)
{
for (int i = 1; i <= n - 1; i++)
{
int j = i + l - 1;
m.at(i).at(j) = (1 << 21);
for (int k = i; k <= j - 1; k++)
{
m.at(i).at(j) = min(m.at(i).at(j), m.at(i).at(k) + m.at(k+1).at(j) + p[i - 1] * p[k] * p[j]);
}
}
}
cout << m[1][n] << endl;
return 0;
} | #include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define INFTY (1<<30)
int m[101][101];
int p[101];
int n;
void multiplyMatrix(){
int i, l, j, k;
for(i = 1;i <= n;i++)
m[i][i] = 0;
for(l = 2;l <= n;l++){
for(i = 1;i <= n - l + 1;i++){
j = i + l - 1;
m[i][j] = INFTY;
for(k = i;k < j;k++)
m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j]);
}
}
}
int main(void){
int i;
scanf("%d", &n);
for(i = 0;i < n;i++)
scanf("%d %d", &p[i], &p[i + 1]);
multiplyMatrix();
printf("%d\n", m[1][n]);
return 0;
} | 1 | 14,098,386 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
int main(){
int n;
std::cin >> n;
std::vector<int> a(n), orderd(n);
for(int i = 0; i < n; i++){
std::cin >> a[i];
orderd[i] = a[i];
}
std::sort(orderd.begin(), orderd.end());
if(orderd[n - 1] == orderd[n - 2]){
for(int i = 0; i < n; i++){
std::cout << orderd[n - 1] << std::endl;
}
}else{
for(int i = 0; i < n; i++){
if(a[i] == orderd[n - 1]){
std::cout << orderd[n - 2] << std::endl;
}else{
std::cout << orderd[n - 1] << std::endl;
}
}
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define Rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int a[n], b[n];
rep (i, n) {
cin >> a[i];
b[i] = a[i];
}
sort(a, a + n, greater<int>());
rep (i, n) {
if (a[0] == b[i]) cout << a[1] << endl;
else cout << a[0] << endl;
}
} | 1 | 32,640,233 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int r, g;
cin >> r >> g;
cout << r * r - g << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int masu;
int shiromasu,kuromasu=0;
cin >> masu ;
cin >> shiromasu ;
kuromasu = (masu*masu)-shiromasu;
cout << kuromasu << endl;
} | 1 | 27,428,259 |
#include <iostream>
#include <vector>
#define MAX_N 100000
#define pb push_back
using namespace std;
int par[MAX_N];
void init(int n){
for(int i=0;i<n;i++){
par[i]=i;
}
}
int root(int x){
if(par[x]==x){
return x;
}
else{
return par[x]=root(par[x]);
}
}
bool same(int x,int y){
return root(x)==root(y);
}
void unite(int x,int y){
x=root(x);
y=root(y);
if(x==y)return;
par[x]=y;
}
int main(){
int n,q;
int a,b,c;
cin>>n>>q;
init(n);
while(q--){
cin>>a>>b>>c;
if(a==0){
unite(b,c);
}
else{
cout<<same(b,c)<<endl;
}
}
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
using namespace std;
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define INT(a) int((a)+1e-9)
int DX[4]={1,0,-1,0};
int DY[4]={0,1,0,-1};
typedef pair<int,int> Pii;
#define SUPnl 10002
int nl;
int p[SUPnl];
int init(){REP(ni,nl){p[ni]=-1;}}
int getRoot(int a){
int ra=a;
while(p[ra]!=-1){ra=p[ra];}
if(ra!=a)p[a]=ra;
return ra;
}
bool same(int a, int b){
return getRoot(a) == getRoot(b);
}
void unite(int a, int b){
a=getRoot(a);
b=getRoot(b);
if(a==b) return;
p[b]=a;
}
int main(){
int ol;
cin>>nl>>ol;
init();
int ot,a,b;
REP(oi,ol){
cin>>ot>>a>>b;
if(ot==0) unite(a,b);
if(ot==1) cout<<same(a,b)<<endl;
}
} | 1 | 65,814,879 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#include <numeric>
#define IINF 1000000000
#define INF 3223372036854775807
#define MOD 1000000007
#define mod 1000000007
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) fo-r (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n,k) ((n>>k)&1)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
ll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}
#define invp(a,p)pom(a,p-2,p)
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp1(pair<ll,ll> a,pair<ll,ll> b){
if(a.fi!=b.fi)
return a.fi<b.fi;
else
return a.se>b.se;
}
ll cmp(ll a,ll b){
return abs(a)<abs(b);
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b;cin>>a>>b;
if(a*b==15){
cout<<"*"<<endl;
}
else if(a+b==15){
cout<<"+"<<endl;
}
else cout<<"x"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a%b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main(){
int a, b;
cin >> a >> b;
if(a + b == 15){
cout << '+' << endl;
}else if(a * b == 15){
cout << '*' << endl;
}else{
cout << "x" << endl;
}
return 0;
} | 1 | 50,866,749 |
#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(x) (x).begin(), (x).end()
const ll INF = 100100100100100100;
const ll MOD = 1000000007;
ll my_abs(ll a);
ll a_n(ll a, ll n);
ll my_gcd(ll a, ll b);
ll inv(ll a);
ll madd(ll a, ll b, ll c);
ll msub(ll a, ll b);
ll mtime(ll a, ll b, ll c);
int main() {
string s;
cin >> s;
rep(i, 3) {
if(s[i] == '1') cout << 9;
else cout << 1;
}
cout << endl;
return 0;
}
ll my_abs(ll a) {
if(a >= 0) return a;
else return -1 *a;
}
ll a_n(ll a, ll n) {
if(n == 0) return 1;
ll ret = a, count = 1;
while(count * 2 < n) {
ret *= ret;
count *= 2;
}
if(count == n) return ret;
else return (ret * a_n(a, n-count));
}
ll my_gcd(ll a, ll b) {
if(b == 0) return a;
return my_gcd(b, a%b);
}
ll inv(ll a) {
return a_n(a, MOD-2);
}
ll madd(ll a, ll b, ll c) {
ll ret = (a+b) % MOD;
return (ret+c) % MOD;
}
ll msub(ll a, ll b) {
if(a < b) return (a-b+MOD) % MOD;
else return (a-b) % MOD;
}
ll mtime(ll a, ll b, ll c) {
ll ret = (a*b) % MOD;
return (ret*c) % MOD;
} | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>
#include <queue>
#include <map>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldouble = long double;
#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")
int ctoi(char c) {
switch (c)
{
case '0': return 0;
case '1': return 1;
case '2': return 2;
case '3': return 3;
case '4': return 4;
case '5': return 5;
case '6': return 6;
case '7': return 7;
case '8': return 8;
case '9': return 9;
default:
cout << "ERR_ctoi" << endl;
return -1;
}
}
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; ++i) {
if (s[i] == '1') s[i] = '9';
else s[i] = '1';
}
PRI(s);
return 0;
} | 1 | 99,982,971 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
string T;
cin >> S >> T;
sort(S.begin(), S.end());
sort(T.begin(), T.end());
reverse(T.begin(), T.end());
if(S < T) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #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, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using pint = pair<int,int>;
using pll = pair<ll,ll>;
using Graph = vector<vector<int>>;
int main(){
string s,t; cin>>s>>t;
sort(s.begin(),s.end());
sort(t.rbegin(),t.rend());
rep(i,min(s.size(),t.size())){
if(s[i]<t[i]){
cout<<"Yes"<<endl;
return 0;
}else if(s[i]==t[i])continue;
else{
cout<<"No"<<endl;
return 0;
}
}
if(s.size()>=t.size()){
cout<<"No"<<endl;
return 0;
}
cout<<"Yes"<<endl;
return 0;
} | 1 | 63,521,313 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,X;
cin >> A >> B >> X;
if(A+B<X){
cout << "NO" << endl;
return 0;
}
if(A>X){
cout << "NO" << endl;
return 0;
}
cout << "YES" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
int a,b,x;
cin>>a>>b>>x;
if (a<=x&&x<=a+b) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
} | 1 | 69,084,187 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
const int mod=1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll x,y;cin >> x >> y;
if(abs(x-y)<=1) cout << "Brown" << endl;
else cout << "Alice" << endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<int, P> E;
const LL MOD = 1000000007LL;
int main() {
LL X, Y;
cin >> X >> Y;
if (abs(X - Y) <= 1) {
cout << "Brown" << endl;
}
else {
cout << "Alice" << endl;
}
} | 1 | 13,426,246 |
#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() {
ll n,m;
cin >> n >> m;
vector<pair<ll,ll>>p(n);
for(int i=0;i<n;i++){
cin >> p.at(i).first >> p.at(i).second;
}
sort(p.begin(),p.end());
ll ans = 0;
for(int i=0;i<n;i++){
ll a = p.at(i).first;
ll b = p.at(i).second;
if(m>b){
m -= b;
ans +=a*b;
}
else{
ans +=a*m;
cout << ans << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<pair<ll, ll> > drink(n);
REP(i, n) {
ll a, b;
cin >> a >> b;
drink[i] = make_pair(a, b);
}
sort(drink.begin(), drink.end());
ll ans = 0;
int i = 0;
while(m > 0) {
if (drink[i].second <= m) {
ans += drink[i].first * drink[i].second;
m -= drink[i].second;
} else {
ans += m * drink[i].first;
break ;
}
i++;
}
cout << ans << '\n';
return 0;
} | 1 | 24,436,033 |
#include <iostream>
using namespace std;
int main() {
int sum , m;
cin >> sum >> m;
int cs = 0;
for(int i = 0 ; i < m ; i++){
int y;
cin >> y;
cs+= y;
}
cout << max(sum - cs , -1) << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N;
cin >> M;
vector<int> A(M);
int sum = 0;
for (int i=0; i<M; i++) {
cin >> A[i];
sum += A[i];
}
if (N < sum) {
cout << -1 << endl;
} else {
cout << N - sum << endl;
}
} | 1 | 68,606,165 |
#include <iostream>
#include <vector>
int main(){
std::vector<int> in_train;
std::vector<int> out_train;
int a;
while(std::cin >> a){
if(a == -1){
break;
}else if(a > 0){
in_train.push_back(a);
}else if(a == 0){
int e = in_train.back();
out_train.push_back(e);
in_train.pop_back();
}
}
while(out_train.empty() != true){
int e = out_train.front();
std::cout << e << std::endl;
out_train.erase(out_train.begin());
}
return 0;
} | #include<stdio.h>
int i = 0, result;
int train[100];
int outtrain[100];
void push(int k){
train[i] = k;
i++;
}
void pop(int train[]){
int a, check = 0;
for(a = i - 1; a >= 0; a--){
if(train[a] != 0){
result = train[a];
train[a] = 0;
check += 1;
}
if(check != 0)break;
}
}
int main(){
int k, cnt = 0;
outtrain[100] = 0;
while(scanf("%d", &k) != EOF){
push(k);
if(k == 0){
pop(train);
outtrain[cnt] = result;
cnt++;
i -= 2;
}
}
for(k = 0; k <= cnt; k++){
if(outtrain[k] != 0)printf("%d\n", outtrain[k]);
}
return 0;
} | 1 | 74,813,090 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
while(getline(cin,s),s!="."){
stack<char> a;
bool flag=false;
for(int i=0;i<s.size();++i){
if(s[i]=='(' || s[i]=='[') a.push(s[i]);
else if(s[i]==')')
if(a.empty() || a.top()!='(') flag=true;
else a.pop();
else if(s[i]==']')
if(a.empty() || a.top()!='[') flag=true;
else a.pop();
if(flag) break;
}
if(flag || !a.empty()) cout<<"no\n";
else cout<<"yes\n";
}
return 0;
} | #include<iostream>
#include<string>
#include<stack>
using namespace std;
string s;
void solve(){
stack<char> T;
for(int i=0;i<s.size();i++){
if(s[i]=='(' || s[i]=='[')
T.push(s[i]);
if(s[i]==')'){
if(T.empty()){cout<<"no"<<endl;return;}
if(T.top()=='(') T.pop();
else{cout<<"no"<<endl;return;}
}
if(s[i]==']'){
if(T.empty()){cout<<"no"<<endl;return;}
if(T.top()=='[') T.pop();
else{cout<<"no"<<endl;return;}
}
}
if(T.empty())
cout<<"yes\n";
else cout<<"no\n";
}
int main(){
while(getline(cin,s)){
if(s==".") break;
solve();
}
return 0;
} | 1 | 3,628,816 |
#include<bits/stdc++.h>
using namespace std;
int main ()
{
int n,k,a;
cin>>n>>k;
a=n%k;
cout<<a<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
if (K == 1){
cout << 0 << endl;
}
else if(K == N){
cout << 0 << endl;
}
else {
cout << N - K << endl;
}
} | 1 | 95,844,022 |
#include <cstdio>
#include <cstdint>
#include <vector>
#include <algorithm>
#include <utility>
#include <numeric>
bool f(std::vector<intmax_t>& a) {
std::sort(a.rbegin(), a.rend());
intmax_t n = a.size();
a[0] -= n;
for (size_t i = 1; i < a.size(); ++i) ++a[i];
std::sort(a.begin(), a.end());
return !std::all_of(a.begin(), a.end(), [=](auto x) { return x < n; });
}
int main() {
size_t n;
scanf("%zu", &n);
std::vector<intmax_t> a(n);
for (auto& ai: a) scanf("%jd", &ai);
if (std::all_of(a.begin(), a.end(), [=](auto x) { return x < intmax_t(n); }))
return puts("0"), 0;
intmax_t res = 0;
while (true) {
intmax_t s = 0;
for (size_t i = 0; i < n; ++i)
s += a[i] / n;
auto b = a;
for (size_t i = 0; i < n; ++i) {
b[i] += (s-b[i]/n) - (b[i]/n)*n;
}
if (std::any_of(a.begin(), a.end(), [=](auto x) { return x >= intmax_t(n); })) {
a = std::move(b);
res += s;
} else {
break;
}
}
if (std::any_of(a.begin(), a.end(), [=](auto x) { return x >= intmax_t(n); })) {
while (f(a)) ++res;
}
printf("%jd\n", res);
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdint>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
int N; std::cin >> N;
std::vector<int64_t> a(N);
for(int i = 0; i < N; ++i) std::cin >> a[i];
int64_t sum = 0;
for(int i = 0; i < N; ++i) sum += a[i];
std::sort(a.begin(), a.end());
if(a.back() < N) fin(0);
int64_t sum2 = 0;
for(int i = 0; i <= N; ++i) {
for(auto& v: a) v %= N+1;
std::sort(a.begin(), a.end());
if(a.back() == N-1) {
int64_t cur = 0;
for(int64_t v: a) cur += v;
if(cur < sum) sum2 = std::max(sum2, cur);
}
for(auto& v: a) ++v;
}
fin(sum - sum2);
return 0;
} | 1 | 99,682,860 |
#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;
bool isSameDigits(int x) {
int left = x % 10;
bool isSame = true;
while (x > 0) {
if (left != x % 10) isSame = false;
x /= 10;
}
return isSame;
}
int main() {
int N;
cin >> N;
int ans;
for (int i = N; i <= 999; i++) {
if (isSameDigits(i)) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vstr;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define asd cout << "ok" << endl;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define trav(it, m) for(auto it = m.begin(); it it!= m.end(); it++)
const char nl = '\n';
const int MOD = 1e9 +7;
const ll INF = 1e19;
const ld PI = acos((ld)-1);
const int MX = 2e5 + 5;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
for(int i = 1; i <= 9; i++)
{
if(111*i >= n)
{
cout << 111*i << nl;
return 0;
}
}
return 0;
} | 1 | 34,258,941 |
const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
string Ans[2] = {"No", "Yes"};
string ANS[2] = {"NO", "YES"};
ll inq(ll x, ll y)
{
if (!y) re 1 % MOD;
ll l = inq(x, y / 2);
if (y % 2) re l * l % MOD * x % MOD;
re l * l % MOD;
}
ll rev(ll x)
{
return inq(x, MOD - 2);
}
bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;
void __precompute_combinatorics()
{
__precomputed_combinatorics = 1;
__fact.resize(FN);
__ufact.resize(FN);
__rev.resize(FN);
__rev[1] = 1;
for (int i = 2; i < FN; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
__fact[0] = 1, __ufact[0] = 1;
for (int i = 1; i < FN; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
ll fact(int x)
{
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[x];
}
ll cnk(int n, int k)
{
if (k < 0 || k > n) return 0;
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
int Root(int x, vector<int> &root)
{
if (x == root[x]) return x;
return root[x] = Root(root[x], root);
}
void Merge(int v, int u, vector<int> &root, vector<int> &sz)
{
v = Root(v, root), u = Root(u, root);
if (v == u) return;
if (sz[v] < sz[u])
{
sz[u] += sz[v];
root[v] = u;
}
else
{
sz[v] += sz[u];
root[u] = v;
}
}
int ok(int x, int n)
{
return 0 <= x && x < n;
}
void bfs(int v, vi &dist, vector<vi> &graph)
{
fill(all(dist), -1);
dist[v] = 0;
vi q = {v};
for (int i = 0; i < q.size(); i++)
{
for (auto u : graph[q[i]])
{
if (dist[u] == -1)
{
dist[u] = dist[q[i]] + 1;
q.push_back(u);
}
}
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
vi a = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int x;
cin >> x;
cout << a[x - 1];
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,i,c;
scanf("%d",&a);
if(a==4||a==6||a==9||a==14||a==21||a==22||a==25||a==26)
{
printf("2\n");
}
else if(a==8||a==12||a==18||a==20||a==27)
{
printf("5\n");
}
else if(a==28||a==30)
{
printf("4\n");
}
else if(a==32)
{
printf("51\n");
}
else if(a==16)
{
printf("14\n");
}
else if(a==24)
{
printf("15\n");
}
else
{
printf("1\n");
}
} | 1 | 23,193,336 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int kaunto = 0;
cin >> a >> b;
for (int i = 0; i < 10000000; i++) {
if (a < b) {
cout << a;
kaunto++;
if (kaunto >= b) {
break;
}
}
if (a > b) {
cout << b;
kaunto++;
if (kaunto >= a) {
break;
}
}
if (a == b) {
cout << a;
kaunto++;
if (kaunto >= a) {
break;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int N = 0;
for (int i = 0; i < max(a, b); i++) {
N *= 10;
N += min(a, b);
}
cout << N << endl;
} | 1 | 77,546,909 |
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <queue>
#include <algorithm>
#include <math.h>
#define DEBUG 0
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll mod = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
int main(){
#if DEBUG
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
#endif
ll n,m,d;
cin >> n >> m >> d;
ll kumi = 0;
if(d == 0)kumi = n;
else
{
for(ll i = 1; i <= n; ++i)
{
if(i - d >= 1)++kumi;
if(i + d <= n)++kumi;
}
}
double res;
res = (double)(m-1) * (double)kumi;
ll cnt = 0;
while(cnt < 2)
{
++cnt;
res /= double(n);
}
printf("%.12f\n",res);
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
double n, m, d;
cin >> n >> m >> d;
double ans = (m - 1.0)*(n - d);
if (d != 0) {
ans *= 2.0;
}
ans /= n;
ans /= n;
printf("%.10f\n", ans);
} | 1 | 529,119 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,count_1,count_2,count_3,count_4;
bool A = true;
count_1=0;
count_2=0;
count_3=0;
count_4=0;
for(int i =0; i<6;i++){
cin >>a;
if(a==1){
count_1++;
}
else if(a==2){
count_2++;
}
else if(a==3){
count_3++;
}
else if(a==4){
count_4++;
}
}
if(count_1==3 || count_2==3 || count_3==3 || count_4==3){
A = false;
}
if(A==true){
cout << "YES" <<endl;
}
if(A==false){
cout << "NO"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int a,memo[4]={};
for (int i = 0; i < 6; ++i)
{
cin>>a;--a;
++memo[a];
}
int cnt=0;
for (int i = 0; i < 4; ++i)
{
if (memo[i]%2==1)
{
++cnt;
}
}
if (cnt==0||cnt==2)
{
cout<<"YES\n";
}
else
{
cout<<"NO\n";
}
return 0;
} | 1 | 16,694,906 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
char op;
cin >> A >> op >> B;
if(op == '+') A += B;
if(op == '-') A -= B;
cout << A << endl;
} | #include <cstdio>
int main()
{
int a,b;
char op;
scanf("%d %c %d",&a, &op, &b);
if(op == '-')
{
printf("%d",a-b);
}
else
{
printf("%d",a+b);
}
} | 1 | 16,337,845 |
#include<iostream>
using namespace std;
int main()
{
int n, a, b, c;
cin >> n;
a = n / 100;
b = (n / 10) % 10;
c = n % 10;
if(a == 1)
a = 9;
else a = 1;
if(b == 1)
b = 9;
else b = 1;
if(c == 1)
c = 9;
else c = 1;
cout << 100 * a + 10 * b + c;
return 0;
} | #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)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
FastRead
string s;
cin>>s;
for(int i=0;i<s.length();i++){
if(s[i]=='1')
s[i]='9';
else if(s[i]=='9')
s[i]='1';
}
cout<<s<<endl;
return 0;
} | 1 | 47,770,124 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
int x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
vector<int> p(a),q(b),r(c);
rep(i,a) cin>>p[i];
rep(i,b) cin>>q[i];
rep(i,c) cin>>r[i];
vector<int> pq;
sort(all(p));
reverse(all(p));
rep(i,x) pq.push_back(p[i]);
sort(all(q));
reverse(all(q));
rep(i,y) pq.push_back(q[i]);
rep(i,c) pq.push_back(r[i]);
sort(all(pq));
reverse(all(pq));
ll ans=0;
rep(i,x+y) ans+=pq[i];
cout<<ans<<endl;
} | #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>;
ll x = 1e9 + 7;
const int INF = 1001001001;
int main() {
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<ll> p(a), q(b), r(c);
rep(i,a) cin >> p[i];
rep(i,b) cin >> q[i];
rep(i,c) cin >> r[i];
sort(p.rbegin(), p.rend());
sort(q.rbegin(), q.rend());
vector<ll> d;
rep(i,x) d.push_back(p[i]);
rep(i,y) d.push_back(q[i]);
rep(i,c) d.push_back(r[i]);
ll ans = 0;
sort(d.rbegin(), d.rend());
rep(i,x+y) ans += d[i];
cout << ans << endl;
return 0;
} | 1 | 40,879,452 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
ll a, b, c, k;
cin >> a >> b >> c >> k;
ll ans = 0;
if (k % 2 == 0) ans = a - b;
else ans = b - a;
if (abs(ans) > 1000000000000000000) {
cout << "Unfair" << endl;
} else {
cout << ans << endl;
}
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> llP;
int main() {
ll a,b,c,k;
cin>>a>>b>>c>>k;
if(k%2==0) cout<<a-b<<endl;
else cout<<b-a<<endl;
return 0;
} | 1 | 41,166,566 |
#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 N, M;
vector<ll> A;
vector<ll> sum;
int main() {
cin >> N >> M;
A.resize(N);
rep(i, N) cin >> A[i];
sum.resize(N + 1);
sum[0] = 0;
rep(i, N) {
sum[i + 1] = (sum[i] + A[i]) % M;
}
map<ll, ll> mp;
rep(i, N + 1) {
mp[sum[i]]++;
}
ll ans = 0;
for (auto m : mp) {
ll tmp = m.second * (m.second - 1) / 2;
ans += tmp;
}
cout << ans << endl;
} | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
ll N, M;
ll A[int(1e5 + 5)], sum[int(1e5 + 5)];
map<ll, ll> mp;
int main(){
scanf("%lld%lld", &N, &M);
mp[0]++;
for (int i = 1; i <= N; i++){
scanf("%lld", A+i);
sum[i] = sum[i-1] + A[i];
sum[i] %= M;
mp[sum[i]]++;
}
ll ans = 0;
for (int i = 0; i <= N; i++){
mp[sum[i]]--;
ans += mp[sum[i]];
}
cout << ans << endl;
return 0;
} | 1 | 37,578,730 |
#pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
constexpr ll LINF = 1e18;
#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto& x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
string alph("abcdefghijklmnopqrstuvwxyz");
char s[10][10];
ll n, cnt, ans, a, b, c, d, tmp, m, h, w, x, y, sum, k, q;
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
rep(i, 2) rep(j, 3) cin >> s[i][j];
rep(j, 3) {
if (s[0][j] == s[1][2 - j]) continue;
Cout("NO");
return 0;
}
Cout("YES");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
string s1,s2;
cin >> s1 >> s2;
reverse(s2.begin(), s2.end());
if(s1 == s2) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | 1 | 42,452,129 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int a;
for(int i=0; i<m; i++){
cin>>a;
n -= a;
}
if(n < 0){
cout<<"-1"<<endl;
}else{
cout<<n<<endl;
}
} | #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)
using ll = long long;
int main()
{
int n,m;
cin >> n >> m;
int sum = 0;
rep(i,m) {
int a;
cin >>a;
sum += a;
}
if( n >= sum) cout << (n - sum) << endl;
else cout << "-1" << endl;
return 0;
} | 1 | 85,401,879 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
int A,B,K;
cin >> A >> B >> K;
rep(i,K)
if(i%2) {
if(B%2)
--B;
B /= 2;
A += B;
} else {
if(A%2)
--A;
A /= 2;
B += A;
}
cout << A << " " << B << endl;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pii = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rRep(i,a,b) for(int i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
if('0' <= c && c <= '9') return (c-'0');
return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
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) { a=b; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
for(auto i=begin(v); i != end(v); ++i){
if(i !=begin(v)) os << ' ';
os << *i;
}
return os;
}
int main(){
ll A,B,K;
cin >> A >> B >> K;
rep(i,K){
if(i%2==0){
if(A%2==1){
A--;
}
B+=A/2;
A/=2;
}
else{
if(B%2==1){
B--;
}
A+=B/2;
B/=2;
}
}
cout << A << " " << B << endl;
} | 1 | 81,592,776 |
#include <stdio.h>
int main() {
char str[19];
scanf("%[^\n]", str);
for (int i=0; str[i] != '\0'; i++){
if (str[i] >= 'a' && str[i] <= 'z'){
printf("%c", str[i]);
}
else printf(" ");
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll mod = 1000000007 ;
bool prime(ll n)
{
bool cnt = 0;
for(ll i=2; i*i<=n; i++)
{
if(n%i==0)
{
return 0;
}
}
return 1 ;
}
int main()
{
string s;
getline(cin,s);
for(int i=0; i<s.size(); i++)
{
if(s[i] == ',')s[i] = ' ' ;
}
cout << s << endl;
} | 1 | 98,533,736 |
#include <iostream>
#include <algorithm>
#include <string>
#define INF 100000
using namespace std;
int dp[1000][1000];
string X, Y;
int lcs(int i,int j){
if(i < 0 || j < 0) return 0;
if(dp[i][j] != INF) return dp[i][j];
if(X[i] == Y[j]){
dp[i][j] = lcs(i-1, j-1) + 1;
return dp[i][j];
} else {
dp[i][j] = max(lcs(i-1,j), lcs(i, j-1));
return dp[i][j];
}
}
void clear(){
for(int i = 0;i < X.size();i++){
for(int j = 0;j < Y.size();j++){
dp[i][j] = INF;
}
}
}
int main(){
int q;
cin >> q;
for(int i = 0;i < q;i++){
cin >> X >> Y;
clear();
cout << lcs(X.size()-1, Y.size()-1) << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#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--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
#define IN(n,a) rep(i,n){ cin>>a[i]; }
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265
void f(){
string x,y;
cin>>x>>y;
int dp[1100][1100]={};
rep(i,x.length()+1){
rep(j,y.length()+1){
if(i==0||j==0) continue;
if(x[i-1]==y[j-1]) dp[i][j]=dp[i-1][j-1]+1;
else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
}
}
cout<<dp[(int)x.length()][(int)y.length()]<<endl;
}
int main(){
int q;
cin>>q;
while(q--){
f();
}
} | 1 | 79,809,152 |
#include<bits/stdc++.h>
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
class modint {
static constexpr std::int_fast64_t Modulus = 1e9 + 7;
using u64 = std::int_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x% Modulus) {}
constexpr u64& value() noexcept { return a; }
constexpr const u64& value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const ll rhs) const noexcept {
return modint(*this) *= modint(rhs);
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint& operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint& operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint& operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr operator u64() const { return a; }
};
int main() {
ll n, m, k;
cin >> n >> m >> k;
rep(i, n+1) {
ll b = n - i;
rep(j, m+1) {
auto s = b* j + i * (m - j);
if (s == k) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
signed main(void)
{
int n, m, K;
cin >> n >> m >> K;
rep(k, n)
{
rep(l, m)
{
if (k * (m - l) + (n - k) * l == K)
{
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | 1 | 71,595,686 |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef pair<double, double> pdd;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
int main() {
std::ios::sync_with_stdio(false); std::cin.tie(0);
vi a(3);
cin >> a[0] >> a[1] >> a[2];
if (a[0] == a[1] && a[1] == a[2]) cout << "Yes\n";
else cout << "No\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
if(a == b && b == c && c == a) {
puts("Yes");
} else {
puts("No");
}
return 0;
} | 1 | 84,885,819 |