Submission #7098

#TimeUsernameProblemLanguageResultExecution timeMemory
7098tncks0121질문 (CEOI14_question_grader)C11
27 / 100
1622 ms25676 KiB
int encode (int n, int x, int y) { int k; for(k = 0; k <= 9; k++) { if(((x >> k) ^ (y >> k)) & 1) { int t = (x >> k) & 1; return k * 2 + t + 1; } } return -1; }
int decode (int n, int q, int h) { --h; int b = h & 1, k = h >> 1; return (((q >> k) & 1) == b); }
#Verdict Execution timeMemoryGrader output
Fetching results...