given an array with n elements, and Q queries consisting of an integer find whether there exists an element in the array such that it's bitwise and is zero
1<=n<10^5 , 1<=q<10^5.
Can anyone tell how to do this question.
Google Online Assesment Question
given an array with n elements, and Q queries consisting of an integer find whether there exists an element in the array such that it's bitwise and is zero
1<=n<10^5 , 1<=q<10^5.
Can anyone tell how to do this question.
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | FifthThread | 2021-07-23 14:51:14 | 261 | Initial revision (published) |