# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
17405 | 2015-11-27T18:58:07 Z | eaststar | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 0 ms | 0 KB |
int A[930]; bool initchk=true; void init(){ int i,j=1; initchk=false; for(i=63;i<4096;++i){ int cnt=__builtin_popcount(i); if(cnt==6)A[j++]=i; } } int encode(int N,int x,int y){ if(initchk)init(); x=A[x],y=A[y]; return __builtin_ffs(x&(x^y)); }