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,t;
t = 0;
for(i=0; i<N; i++) t += (M[i]*(1 << i));
send(t);
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[])
{
int i, b;
b = X[0];
for(i=0; i<N; i++){
if(b%2 == 1) output(1);
else output(0);
b /= 2;
}
}
# | 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... |