# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95925 | 2019-02-04T12:12:33 Z | Bodo171 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 0 ms | 0 KB |
int lsb(int x) { return ((x^(x-1))&x); } int norm[2000]; int encode (int n, int a, int b) { for(int i=0;i<=9;i++) norm[(1<<i)]=i+1; return norm[lsb((a^b))]+9*((lsb((a^b))&a)!=0); }