# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18650 | 2016-02-13T10:07:22 Z | ggoh | Parrots (IOI11_parrots) | C++ | 0 ms | 0 KB |
#include "encoder.h" #include "decoder.h" #include<cstdio> #include<algorithm> #include<cstring> #include<vector> #include<queue> void encode(int N,int M[]) { int t,u; for(int i=0;i<N;i++) { u=M[i];t=0; while(u) { if(u%2)send(32*t+i); u/=2; t++; } } }