# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
229270 | 2020-05-04T02:39:20 Z | super_j6 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 0 ms | 0 KB |
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; }