Admin

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

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

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

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

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

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

#include <stdio.h> #include <string.h> int c, p, sz, gov; int find_parent(int n)...

#include <limits.h> #include <stdio.h> int main() { int i, j, n, m,...

#include<stdio.h> #include<string.h> void cycle(char s,int len) { char temp=s; int i; for(i=len-1;i>0;i--) { s=s; } s=temp; } int main(){ char s,orig; int len,count=0; scanf("%s",s); len=strlen(s); strcpy(orig,s); do { cycle(s,len); count++; } while(strcmp(orig,s)); printf("%dn",count); return...

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

#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; }

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