Codeforces Round #388 (Div. 2) Archive

Codeforces Round #388 (Div. 2), problem: (E) Inversions After Shuffle Solution in C/C++   #include <stdio.h> #include <stdlib.h> #include <string.h> #define N 100000 /* Fenwick tree */ void update(long long *tt, int i, int n, …

Codeforces Round #388 (Div. 2), problem: (D) Leaving Auction Solution in C/C++   #include<stdio.h> #include<stdlib.h> typedef unsigned u; u *G,Ga,Gi,M,P,S,V; int F(const void*x,const void*y) { if(M>M)return 1; if(M<M)return-1; if(*(u*)x<*(u*)y)return 1; if(*(u*)x>*(u*)y)return-1; return 0; } int …

Codeforces Round #388 (Div. 2), problem: (C) Voting Solution in C/C++   #include<stdio.h> typedef unsigned u; char S,D; int main() { u l,i,ds,rs,dq,rq; ds=rs=dq=rq=0; scanf("%u%s",&l,S); for(i=-1;++i<l;) { if(S=='D')++ds; if(S=='R')++rs; } for(;ds&&rs;) { for(i=-1;++i<l;)if(!D) { if(S=='D') …

Codeforces Round #388 (Div. 2), problem: (B) Parallelogram is Back Solution in C/C++     int main() { int x1,y1,x2,y2,x3,y3; scanf("%d%d\n%d%d\n%d%d",&x1,&y1,&x2,&y2,&x3,&y3); printf("3\n%d %d\n%d %d\n%d %d",x1+x2-x3,y1+y2-y3,x2+x3-x1,y2+y3-y1,x3+x1-x2,y3+y1-y2); return 0; }    

Codeforces Round #388 (Div. 2), problem: (A) Bachgold Problem Solution in C/C++   #include<stdio.h> typedef unsigned u; int main() { u n; scanf(“%u”,&n); printf(“%u\n”,n>>1); if(n&1){printf(“3 “);n-=3;} while(n){printf(“2 “);n-=2;} return 0; }