# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
36406 | mohammad_kilani | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 1788 ms | 27472 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.
#include <bits/stdc++.h>
using namespace std;
int encode (int n, int x, int y) {
int cur = 0 ;
for(int i=0;i<20;i++){
if(((x >> i) & 1) != ((y >> i) & 1)){
cur = i;
if(((x >> i) & 1) == 1)
cur += 10;
break;
}
}
return cur + 1;
}
#include <bits/stdc++.h>
using namespace std;
int decode (int n, int q, int h) {
h--;
bool bit = 0;
if(h >= 10) bit = 1, h -= 10;
return (((q >> h) & 1) == bit);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |