# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67235 | zetapi | Parrots (IOI11_parrots) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <encoder.h>
#include <encoderlib.h>
#include <decoder.h>
#include <decoderlib.h>
void encode(int N,int M[])
{
int res=0;
for(int A=0;A<N;A++)
if(M[A])
res+=(1<<A);
send(res);
return ;
}
void decode(int N, int L, int X[])
{
for(int A=0;A<N;A++)
if(X[0]&(1<<A))
output(1);
else
output(0);
return ;
}