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"
using namespace std;
void encode(int N, int M[]) {
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < 8; j++) {
			if (M[i] & (1 << j)) {
				// bit i * N + j is on
				send(i * N + j);
			}
		}
	}
}
#include "decoder.h"
#include "decoderlib.h"
using namespace std;
int A[105];
void decode(int N, int L, int X[]) {
	for (int i = 0; i < N; i++) {
		A[i] = 0;
	}
	for (int i = 0; i < L; i++) {
		int pos = X[i] / N, bit = X[i] % N;
		A[pos] |= (1 << bit);
	}
	for (int i = 0; i < N; i++) {
		output(A[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... |