| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 26811 | baactree | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 1263 ms | 25672 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) {
int r=1;
int mod=11;
for(int i=0;i<9;i++){
r*=x;
r%=mod;
}
return r+1;
}int decode (int n, int q, int h) {
h--;
if((h*q)%11==1)
return 1;
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||