Given n (<= 10^5) bitmasks of length k (<= 22) find number of pairs of bitmasks which AND to 0. Time limit is 2 secs
Can anyone provide an idea for this? Thanks! :)
Given n (<= 10^5) bitmasks of length k (<= 22) find number of pairs of bitmasks which AND to 0. Time limit is 2 secs
Can anyone provide an idea for this? Thanks! :)
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
Name |
---|
Refer this tutorial, the first exercise problem is this and is same as your problem. Try understanding the tutorial and you'll be able to handle this problem.