A bitmask problem

Правка en1, от heyyolol, 2019-08-02 20:18:04

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

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский heyyolol 2019-08-02 20:18:04 185 Initial revision (published)