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 res=0;
for(int A=0;A<N;A++)
res+=M[A]*(1<<A);
send(res);
return ;
}
#include "decoder.h"
#include "decoderlib.h"
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 ;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |