heyyolol's blog

A bitmask problem
By heyyolol, history, 5 years ago, In English

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! :)

  • Vote: I like it
  • +2
  • Vote: I do not like it

»
5 years ago, # |
  Vote: I like it +5 Vote: I do not like it

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.

→ Reply