CodeForces Archive

#include<bits/stdc++.h> #define LL long long using namespace std; const int maxn = 1e5+5; const int mod =1e9+7; typedef pair<int,int>pii; int a; int b; int ans; int p; vector<pii>q; int main() { int n,m; cin>>n>>m; memset(b,-1,sizeof(b)); …

#include <stdio.h> long long n,res,a=1; int main() { for (scanf(“%I64d”,&n);a<n;res+=(n-1)/a*(a-(a>>1)),a<<=1ll); printf(“%I64d\n”,res); return 0; }

#include<stdio.h> int vi={0}; int main(void) { int n, a, now = 2; int ans; scanf(“%d”, &n); int flag = 0; int i,j,k; for (i = 1; i <= n; i++) { scanf(“%d”, &a); ans = …

#include<stdio.h> int main(){ int n; scanf(“%d”,&n); if(n <= 5) printf(“-1\n”); else{ printf(“1 2\n2 3\n2 4\n”); for(int i = 5;i <= n;i++) printf(“1 %d\n”,i); } for(int i = 2;i <= n;i++) printf(“1 %d\n”,i); }

#include<bits/stdc++.h> using namespace std; map<string,int> ms; string str; int arr,temp,mn; int main() { int n,k,m;cin>>n>>k>>m; for(int i=1;i<=n;i++)cin>>str,ms=i; for(int i=1;i<=n;i++)cin>>arr,mn=1e9+7; for(int i=1,j;i<=k;i++) { int x;cin>>x; while(x–)cin>>j,temp=i,mn=min(mn,arr); } unsigned long long res=0; while(cin>>str){res+=mn]];} return cout<<res<<“\n”,0; }

#include <stdio.h> int main() { int N; scanf(“%d”, &N), puts(N&1 ? “Ehab” : “Mahmoud”); }

#include<cstdio> #include<cstring> #include<algorithm> #include<set> using namespace std; int n,k; struct node { int maxx,minn,sz; node() { int x;sz = 1; for(int i = 1; i <= k ; i ++) { scanf(“%d”,&x); minn = maxx …

#include <stdio.h> struct node { __int64 ans,num; }s; int main() { int n,k,m; while(~scanf(“%d%d%d”,&n,&k,&m)) { scanf(“%I64d”,&s.num); s.ans=1; int len=1; for(int i=1;i<n;i++) { int x; scanf(“%d”,&x); if(x==s.num) { s.ans++; if(s.ans==k) { s.ans=0; len–; } } else …

#include <iostream> using namespace std; const int maxn = 5e5; int n, x, a = 0, b = 1023, y; char c; int main() { cin >> n; for (int i = 0; i < …

#include<bits/stdc++.h> using namespace std; int main() { int n,i,s,d,t=0; cin>>n; for(i=0;i<n;i++) { cin>>s>>d; while(s<=t) { s=s+d; } t=s; } cout<<s<<endl; }