# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
343880 | 2021-01-04T16:47:11 Z | beksultan04 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 0 ms | 0 KB |
int pp[10001],cnt=0; int encode (int n, int x, int y) { if (!cnt) for (int i=0;i<(1<<12);++i) if (__builtin_popcount(i) == 6)pp[cnt++]=i; x = pp[x-1]; y = pp[y-1]; for (int i=0;i<12;++i){ if ((x>>i)&1) && !((y>>i)&1) )return i+1; } return 0; }