Monday, December 30, 2024
Sponsors

Tag: CodeForces

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 #444 (Div....

C/C++
#include<stdio.h> int main() { int n,i,j,k,m,A,B; scanf("%d",&n); for(i=1;i<=n;i++){ for(j=1;j<=6;j++){ scanf("%d",&A);} } for(i=1;i<=100;i++){ B=0;} for(i=1;i<=n;i++){ for(j=1;j<=6;j++){ B]=1; for(k=1;k<=n;k++){ for(m=1;m<=6;m++){ if (k!=i){ B*10+A]=1; } } } } } i=1; while(B){ i++;} printf("%d",i-1); return 0; }
Read more

Codeforces Round #444 (Div....

C/C++
#include<stdio.h> char s; int main() { scanf(" %s",s); int x=0,y=0,z=0; while(s=='0') x++; while(s!=0) z++; for(int i=x+1;i<z;i++) if(s=='0')...
Read more

Codeforces Round #436 (Div....

C/C++
#include<cstdio> #include<algorithm> #include<cstring> using namespace std; const int N = 3005, INF =...
Read more

Codeforces Round #436 (Div....

C/C++
#include<iostream> #include<cstdio> #include<algorithm> #include<bitset> using namespace std; struct node{ int t,d,p,tot; }a; int f; bool cmp(node x,node y){ return...
Read more

Codeforces Round #436 (Div....

Uncategorized
#include<stdio.h> int a, b, sum, flag; int main(void) { int n, i, p,...
Read more

Codeforces Round #436 (Div....

C/C++
#include <bits/stdc++.h> using namespace std; int main(){ int k,sum=0,end,cap,f,tank; for(cin>>end>>cap>>f>>k,tank=cap;k--;f=end-f) if(tank<f||cap<end-f) return cout<<-1,0; else if(tank>=end+(k?end-f:0))...
Read more

Codeforces Round #436 (Div....

C/C++
#include <stdio.h> int c; void reset(){ for(int i=0;i<26;i++){ c=0; } } int main(){ int n,i,cur=0,max=0; scanf("%d",&n); char a; scanf("%s",a); reset(); for(i=0;i<n;i++){ if(a>='A' &&...
Read more

Codeforces Round #436 (Div....

C/C++
#include<cstdio> #include<iostream> using namespace std; int n,cnt,ans,A,B; int buck; int main(){ scanf("%d",&n); for(int i = 1;i...
Read more

Codeforces Round #429 (Div....

Java
import java.io.*; import java.util.*; public class E { int a; static final int...
Read more

Codeforces Round #429 (Div....

C/C++
#include <bits/stdc++.h> using namespace std; const int maxN = 3e5+10, base...
Read more

Codeforces Round #429 (Div....

C/C++
#include<bits/stdc++.h> #define ll long long int #define LL long long int #define...
Read more

Codeforces Round #429 (Div....

C/C++
#include<cstdio> using namespace std; const int MAXN = 300000+5; const int MAXE...
Read more

Advertisement

spot_img

EDITOR PICKS

POPULAR POSTS

POPULAR CATEGORY

© E-Blogarithm 2016