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