# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
343682 | juggernaut | 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.
static int arr[924],pos;
int encode (int n, int x, int y){
if(!pos){
int a,b;
for(int i=0;i<4096;i++){
a=i;b=0;
while(a>=1){
b+=(a%2);
a/=2;
}
if(b==6)
arr[pos++]=i;
}
}
x=arr[x-1];y=arr[y-1];
for(int i=0;i<12;i++)
if(x>>i&1 && !(y>>i&1))
return i+1;
}
int decode (int n, int q, int h) {
return (arr[q-1]>>(h-1)&1);
}