Count of submasks of array[i] present in array

Правка en2, от plag-reporter, 2023-01-11 06:13:43

How do I find count of j's such that array[i] | array[j] = array[i] ? Here, '|' is bitwise OR operator.I was thinking of this while solving today's(round 843) problem B. |array| <= 1e5 , max(array) <= 1e18

Теги bitmasks, bitwise operators, codeforces round 843

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский plag-reporter 2023-01-11 06:13:43 9
en1 Английский plag-reporter 2023-01-10 19:58:30 253 Initial revision (published)