# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
164476 | mhy908 | 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 c[930], r;
bool first=true;
int encode(int N, int x, int y)
{
if(first)
for(int i=1; i<=4096; i++)
if(__builtin_popcount(i)==6)c[++r]=i;
first=false;
return __builtin_ffs(c[x]&(c[x]^c[y]));
}
int c[930], r;
bool first=true;
int encode(int N, int q, int h)
{
if(first)
for(int i=1; i<=4096; i++)
if(__builtin_popcount(i)==6)c[++r]=i;
first=false;
return c[q]&(1<<(h-1))?1:0;
}