# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64751 | 2018-08-05T14:13:48 Z | bazsi700 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long int mask[930]; int encode(int n, int x, int y) { for(int j = 0; j < 12; j++) { if((mask[x]&(1<<j)) && !(mask[y]&(1<<j))) { return j+1; } } } int main() { ios::sync_with_stdio(false); cin.tie(0); int nxt = 1; for(int i = 0; i < (1<<12); i++) { int cn = 0; for(int j = 0; j < 12; j++) { if(i&(1<<j)) { cn++; } } if(cn == 6) { mask[nxt++] = i; } } return 0 }