Tag: Codeforces Round #386 (Div. 2)

Codeforces Round #386 (Div. 2), problem: (G) New Roads Solution in C/C++ #include<stdio.h> #include<stdlib.h> typedef unsigned u; u D,H,P,A; int main() { u n,d,x,i=-1,j,k,mi=0,ma=1; for(scanf("%u%u%u",&n,&d,&x);++i<d;)scanf("%u",D+i); for(i=d;i--;ma+=D-1)if(D>D)mi+=D-D; if(x<mi||x>ma){printf("-1n");return...

Codeforces Round #386 (Div. 2), problem: (F) Music in Car Solution in C/C++   #include <stdio.h> #include <string.h> #define MAX(X,Y) ((X)>(Y)...

Codeforces Round #386 (Div. 2), problem: (E) Numbers Exchange Solution in C/C++     #include<stdio.h> #include<stdlib.h> typedef unsigned u; u N,X,C,H; int F(const void*x,const...

Codeforces Round #386 (Div. 2), problem: (C) Tram Solution in C/C++ #include<stdio.h> typedef unsigned u; u x1,x2,s; u F(u p,u d,u...

Codeforces Round #386 (Div. 2), problem: (B) Decoding Solution in C/C++   #include<stdio.h> int main(){ int n,i;char a; scanf("%d",&n); scanf("%s",a); n-=1; for(i=n-1;i>=0;i-=2) { printf("%c",a); } if(n%2==0) i=0; else i=1; for(i;i<=n;i+=2) printf("%c",a); return 0; }

Codeforces Round #386 (Div. 2), problem: (A) Compote Solution in C/C++ #include<stdio.h> int main() { int a,b,c,i; scanf("%d%d%d",&a,&b,&c); for(i=a;i>=1;i--) if(b>=2*i&&c>=4*i) break; printf("%d",7*i); }