# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
564824 | birthdaycake | 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 b[950];
void cal(){
b[0] = 1;
int num = 1;
for(int i = 0; i < 950; i++){
if(__builtin_popcount(i) == 6) b[num++] = i;
}
}
int encoder(int n, int x, int y) {
if(b[0] == 1) cal();
for(int i = 0; i < 12; i++){
if((b[x] & (1 << i)) && !(b[y] & (1 << i))){
return i;
}
}
return 1;
}