# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
447688 | dxz05 | Parrots (IOI11_parrots) | C++14 | 0 ms | 0 KiB |
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"
#include <bits/stdc++.h>
using namespace std;
void encode(int N, int M[]){
assert(N == 8 && M[0] == 1 && M[1] == 0 && M[2] == 1 && M[3] == 0 && M[4] == 0 && M[5] == 1 && M[6] == 1 && M[7] == 0);
for (int i = 0; i < N; i++){
for (int j = 0; j < 8; j++){ /// ABBBBCCC
int code = (M[i] & (1 << j)) > 0;
code <<= 4;
code |= i;
code <<= 3;
code |= j;
send(code);
}
}
}