# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
564829 | 2022-05-19T18:40:11 Z | RealSnake | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 0 ms | 0 KB |
bool first_testcase = 1; bool a[13][924]; int encode(int n, int x, int y) { if(first_testcase) { first_testcase = 0; int k = 0; for(int i = 0; i < (1 << 12); i++) { if(__builtin_popcount(i) == 6) { for(int j = 0; j <= 12; j++) a[j][k] = (i & (1 << j)); k++; } } } for(int i = 0; i < 12; i++) { if(a[i][x] == 1 && a[i][y] == 0) return i + 1; } return 0; }