# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95925 | Bodo171 | 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 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);
}
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);
}