# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
856 | gs13068 | Parrots (IOI11_parrots) | C++98 | 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"
void encode(int N,int M[])
{
int i,j;
for(i=0;i<N;i++)
{
for(j=0;j<8;j++)
if(M[i]&(1<<j))
send(i*8+j);
}
}
#include"decoder.h"
#include"decoderlib.h"
int a[256];
int decode(int N,int L,int X[])
{
int i,j,k;
for(i=0;i<L;i++)a[X[i]]++;
for(i=0;i<N;i++)
{
k=0;
for(j=0;j<8;j++)
k+=a[i*8+j]<<j;
output(k);
}
}