Saturday, May 18, 2024
Sponsors

Tag: Codeforces.com

Codeforces Solution, Codeforces.com solution,codeforces div 1 solution, codeforces division 1 solution,codeforces div 2 solution, codeforces division 2 solution,Codeforces problem,codeforcesproblem solution,codeforces regular problem solution,codeforces regular,c programming sample programms, c programming examples,c++ regular programms, c++ programming examples,programmng language , basic programming,easy programming example,easy programming solutions,C language, c language solutions, c language examples,Codeforces solve, Codeforces.com solve,codeforces div 1 solve, codeforces division 1 solve,codeforces div 2 solve, codeforces division 2 solve,Codeforces problem,codeforcesproblem solve,codeforces regular problem solve,codeforces regular,c programming sample programms, c programming examples,c++ regular programms, c++ programming examples,programmng language , basic programming,easy programming example,easy programming solves,C language, c language solves, c language examples,

Codeforces Round #427 (Div....

C/C++
#include<iostream> #include<cstdio> using namespace std; int a; int x,y,x1,y1,s; int main() { int n,q,c; int i,j,k; scanf("%d%d%d",&n,&q,&c); for(i=1;i<=n;i++) { scanf("%d%d%d",&x,&y,&s); for(j=0;j<=c;j++) a+=(s+j)%(c+1); } for(i=1;i<=100;i++) for(j=1;j<=100;j++) for(k=0;k<=c;k++) a+=a+a-a; for(i=1;i<=q;i++) { scanf("%d%d%d%d%d",&s,&x,&y,&x1,&y1); s%=(c+1); printf("%dn",a-a-a+a); } }
Read more

Codeforces Round #427 (Div....

C/C++
#include <cstdio> int s,t1,t2,v1,v2; int main() { scanf("%d%d%d%d%d",&s,&v1,&v2,&t1,&t2); t1=2*t1+s*v1; t2=2*t2+s*v2; puts((t1==t2)?"Friendship":(t1<t2)?"First":"Second"); }
Read more

Codeforces Round #426 (Div....

C/C++
#include <algorithm> #include <cstdio> #include <cstring> #include <map> #include <set> #include <utility> #include <vector> const int...
Read more

Codeforces Round #426 (Div....

C/C++
#include <iostream> #include <cstring> #include <cstdio> #include <cmath> #include <algorithm> #define maxn 100005 #define mod...
Read more

Codeforces Round #426 (Div....

C/C++
#include <stdio.h> #include <stdlib.h> #include <string.h> #define N 19 char strL, strR; int l,...
Read more

Codeforces Round #426 (Div....

C/C++
#include <bits/stdc++.h> using namespace std; int main() { ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0); int...
Read more

Codeforces Round #426 (Div....

C/C++
#include<cstdio> bool pd; char s; int n,k,size,last; int main(){ scanf("%d%d%s",&n,&k,&s); for (int i=0;i<n;++i) last-'A']=i; for (int...
Read more

Codeforces Round #426 (Div....

C/C++
#include<bits/stdc++.h> using namespace std; int t; int main(){ char a,b; int n; scanf(" %c %c",&a,&b); scanf("%d",&n); n%=4; t=0,t=1,t=2,t=3; int...
Read more

Codeforces Round #422 (Div....

C/C++
#include<cstdio> #include<cstdlib> #include<stdlib.h> #include<iostream> #include<string> #include<string.h> #include<vector> #include<stack> #include<queue> #include<map> #include<cmath> using namespace std; #define pi acos(-1.0) typedef long long ll; typedef double...
Read more

Codeforces Round #422 (Div....

C/C++
#include<bits/stdc++.h> typedef long long ll; const int N=100010; const ll mo=1000000007; int n,x,i,l,r,m,mid,g,j,k; ll...
Read more

Codeforces Round #422 (Div....

C/C++
#include<bits/stdc++.h> using namespace std; long long f,pwr,mod=1e9+7,t,r,l,ans; main() { int i,j,k; cin>>t>>l>>r; pwr=1; //for(i=1;i<=r-l+1;i++)pwr=(1ll*pwr*t)%mod; for(i=0;i<=r;i++) f=1e18; f=0; for(i=1;i<=r;i++) { for(j=2*i,k=2;j<=r;j+=i,k++) { f=min(f,(1ll*i*(k-1)*k)/2+f); } } ans=0;long long pr=1; for(i=l;i<=r;i++) ans=(ans+((f)%mod*pr)%mod)%mod,pr=(pr*t)%mod; cout<<ans<<endl; }
Read more

Codeforces Round #422 (Div....

C/C++
#include<cstdio> #include<vector> #include<cstring> #include<algorithm> #define ll long long using namespace std; ll ans,c,n,x,L,R,cc; vector<pair<ll,ll> >l,r; int main(){ scanf("%lld%lld",&n,&x); for(int...
Read more

Advertisement

spot_img

EDITOR PICKS

POPULAR POSTS

POPULAR CATEGORY

© E-Blogarithm 2016