Sponsors

Tag: Codeforces.com

Codeforces Round #386 (Div....

Codeforces Round #386 (Div. 2), problem: (D) Green and...

Codeforces Round #386 (Div....

Codeforces Round #386 (Div. 2), problem: (C) Tram Solution...

Codeforces Round #386 (Div....

Codeforces Round #386 (Div. 2), problem: (B) Decoding Solution...

Codeforces Round #386 (Div....

Codeforces Round #386 (Div. 2), problem: (A) Compote Solution...

Codeforces Round #385 (Div....

#include<bits/stdc++.h> using namespace std; const int maxn=16,INF=0x3f3f3f3f; char type; int R,B; char readchar() { for(;;)...

Codeforces Round #385 (Div....

#include <limits.h> #include <stdio.h> #define N 1000 void query(int *ww, int *aa, int...

Codeforces Round #384 (Div....

#include <stdio.h> #include <string.h> #define MAX(X,Y) ((X)>(Y) ? (X) : (Y)) #define...

Codeforces Round #384 (Div....

#include<stdio.h> int main(){ long x; scanf("%ld",&x); if(x==1) printf("-1"); else printf("%ld %ld %ld",x,x+1,x*(x+1)); return 0; }

Codeforces Round #384 (Div....

long long k; main() { scanf("%d%lld",&k,&k); printf("%dn",1+__builtin_ctzll(k)); }

Codeforces Round #384 (Div....

#include<stdio.h> int main() { int i,j,n,a,b; char s; scanf("%d%d%d",&n,&a,&b); scanf("%s",s); if(s==s) { printf("0"); } else printf("1"); return 0; }

Codeforces Round #383 (Div....

#include <bits/stdc++.h> using namespace std; #define fo(i,a,b) for(int i=(a);i<(b);i++) #define MOD 1000000007 #define...

Codeforces Round #383 (Div....

#include<stdio.h> int n, m, maxW, p, w, b, prev, next,...

Advertisement

spot_img