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,tt;
int tmp[100];
for(i=0; i<N; i++) tmp[i] = M[i];
for(i=0; i<N; i++){
j = -1;
while(M[i] != 0){
tt = M[i] % 2;
M[i] /= 2;
j++;
if(tt == 0) continue;
send(8*i+j);
}
}
for(i=0; i<N; i++) M[i] = tmp[i];
}
#include "decoder.h"
#include "decoderlib.h"
#include <algorithm>
#include <stdio.h>
using namespace std;
int ans[100];
void decode(int N, int L, int X[]){
int i;
int t1,t2;
for(i=0; i<N; i++) ans[i] = 0;
for(i=0; i<L; i++){
t1 = X[i] / 8;
t2 = X[i] % 8;
ans[t1] += (1 << t2);
}
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... |