Saturday, May 24, 2025
Sponsors

Tag: Codeforces Round #444 (Div. 2)

Codeforces Round #444 (Div....

C/C++
#include<bits/stdc++.h> #define maxn 1000050 using namespace std; int a,b,c,n,k,m,t; int main() { ...
Read more

Codeforces Round #444 (Div....

C/C++
#include<iostream> #include<cstdio> #include<cstring> #include<string> #include<cmath> #include<algorithm> #include<cstdlib> #define eps 1e-7 using namespace std; double x,y,r,L; struct node{double l,r;}a; struct P{double...
Read more

Codeforces Round #444 (Div....

C/C++
#include <cstdio> #include <algorithm> using namespace std; long long n,a,b,c,d,st,len,t; int q; int main() { scanf("%lld%lld%lld%lld%lld%lld%lld",&n,&a,&b,&c,&d,&st,&len); for...
Read more

Codeforces Round #444 (Div....

C/C++
#include <bits/stdc++.h> using namespace std; const int R = { {12, 13,...
Read more

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

Advertisement

spot_img

EDITOR PICKS

POPULAR POSTS

POPULAR CATEGORY

© E-Blogarithm 2016