# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
83853 | 2018-11-11T12:19:29 Z | aminra | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef double ld; const int MAXN = (int)1e5 + 7; const int infint = (int)1e9; const int MOD = (int)1e9 + 9; const ll inf = (ll)2e18 + 2; int encode(int n, int x, int y) { int bt = -1; for (int i = 0; i < 10; i++) if(((x >> i) & 1) != ((y >> i) & 1)) bt = i; if(x > y) return bt + 11; else return bt + 1; }