# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
564832 | Uzouf | 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 encode(int n,int x,int y) {
bitset<10> a=x,b=y;
int h=-1;
for (int p=10;p>=0;p--) {
if (a[p]>b[p]) {h=p+1; break;}
}
if (h==-1) {
int pa=__builtin_popcount(i),pb=__builtin_popcount(j);
a=pa; b=pb;
for (int p=4;p>=0;p--) {
if (b[p]>a[p]) {h=11+p; break;}
}
}
return h;
}