| 3 | int cnt[BITS][1<<BITS]; |
| 4 | misof_tree() { memset(cnt, 0, sizeof(cnt)); } |
| 5 | void insert(int x) { |
| 6 | for (int i = 0; i < BITS; cnt[i++][x]++, x >>= 1); } |
| 7 | void erase(int x) { |
| 8 | for (int i = 0; i < BITS; cnt[i++][x]--, x >>= 1); } |
| 9 | int nth(int n) { |
nothing calls this directly
no outgoing calls
no test coverage detected