# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1116523 | PagodePaiva | Parrots (IOI11_parrots) | C++17 | 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<bits/stdc++.h>
#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 += 2){
int res = 0;
if((1<<j)&M[i]) res += 1;
if((1<<(j+1))&M[i]) res += 2;
res += 4*i;
int d = j/2;
res += 64*d;
send(res);
//cout << res << '\n';
}
}
return;
}