Saturday, November 16, 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 #416 (Div....

C/C++
#include<bits/stdc++.h> using namespace std; int main() { long a,b; cin>>a>>b; a=sqrt(a); if(a*(a+1)>b)cout<<"Valera"; else cout<<"Vladik"; }
Read more

Codeforces Round #415 (Div....

C/C++
#include<iostream> #include<vector> #include<algorithm> #include<cstring> #include<cstdio> #include<cmath> #include<cstdlib> #include<ctime> #include<queue> #include<set> using namespace std; typedef long long LL; const int N=4e5; int gi()...
Read more

Codeforces Round #415 (Div....

C/C++
#include<cstdio> #include<cstdlib> #include<cstring> #include<algorithm> #define nMax 300010 #define INF 2000000100 using namespace std; int n; struct Node { int...
Read more

Codeforces Round #415 (Div....

C/C++
#include <cstdio> using namespace std; #define ff fflush(stdout) #define mid (lef+rig>>1) int n,...
Read more

Codeforces Round #415 (Div....

Uncategorized
#include <bits/stdc++.h> using namespace std; long long n,a,r,m=1e9+7,sum=0; int main(){...
Read more

Codeforces Round #415 (Div....

Uncategorized
#include<bits/stdc++.h> using namespace std; int64_t n,f,k,l,i,w,s,a; int main(){ for(cin>>n>>f;i<n;i++)cin>>k>>l,w=min(k,l),a=min(2*k,l)-w,s+=w; sort(a,a+n); for(i=0;i<n;i++)s+=i<f?a:0; cout<<s; }
Read more

Codeforces Round #415 (Div....

C/C++
#include <cstdio> int n,k,sum=0,mark; int main() { scanf("%d%d",&n,&k); for(int i=1;i<=n;i++)scanf("%d",&mark),sum+=mark; mark=(n*k-sum)*2-n; if(mark>0)printf("%d",mark); else printf("0"); }
Read more

Tinkoff Challenge – Final...

C/C++
#include<iostream> #include<cstdio> #include<fstream> #include<algorithm> #include<vector> #include<map> #include<set> #include<queue> #include<cmath> #include<cstring> #include<cstdlib> using namespace std; int a,b; int main() { int n,i,x,y; cin>>n; for(i=1;i<=n;i=i+1) cin>>a; for(i=1;i<=n;i=i+1) { x=(i-1)-(n-i); if(x<0) x=-x; b=max(b,a); } for(i=1;i<n;i=i+1) { x=(i-1)-(n-i-1); if(x<0) x=-x; b=max(b,min(a,a)); } for(i=2;i<=n;i=i+1) b=max(b,b); for(i=1;i<n;i=i+1) cout<<b<<' '; cout<<b<<endl; return 0; }
Read more

Tinkoff Challenge – Final...

Uncategorized
#include<bits/stdc++.h> #define MAXN 300100 using namespace std; struct node{int y,next;}e; int n,m,len,Link,p,hash,col,vis,used; inline int...
Read more

Tinkoff Challenge – Final...

C/C++
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; #define MN 300000 char a,b,c; bool cmp(char x,char y){return...
Read more

Tinkoff Challenge – Final...

C/C++
#include<bits/stdc++.h> int main(){double p,l,i=1;std::cin>>p>>l;for(;i<p;)printf("%.7f ",sqrt(i++/p)*l);}
Read more

Tinkoff Challenge – Final...

C/C++
#include<cstdio> int main() { int a,b,c,i,ans=0; scanf("%d%d%d",&a,&b,&c); for(scanf("%d",&i);i--;)scanf("%d",&a),a>b&&a<c?++ans:0; printf("%d",ans); }
Read more

Advertisement

spot_img

EDITOR PICKS

POPULAR POSTS

POPULAR CATEGORY

© E-Blogarithm 2016