# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
229270 | super_j6 | Question (Grader is different from the original contest) (CEOI14_question_grader) | 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.
int a[920];
int encode(int n, int x, int y){
x--, y--;
if(!a[0]) for(int i = 0, j = 0; i < n; i++, j++){
while(__builtin_popcount(j) != 6) j++;
a[i] = j;
}
return __lg(a[x] & (a[x] ^ a[y])) + 1;
}
int a[920];
int decode(int n, int x, int y){
x--, y--;
if(!a[0]) for(int i = 0, j = 0; i < n; i++, j++){
while(__builtin_popcount(j) != 6) j++;
a[i] = j;
}
return (a[x] >> y) & 1;
}