Help in bitwise OR problem!

Правка en1, от Yuki726, 2020-04-14 20:56:20

Find a pair in an array with maximum bitwise OR? $$$1 \leq n \leq 1e6, 0 \leq a[i] \leq 1e6$$$

Can anyone help me with the solution or finding a blog somewhere.

Теги #bitwise

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Yuki726 2020-04-14 20:56:20 187 Initial revision (published)