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.
# | User | Rating |
---|---|---|
1 | tourist | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 164 |
4 | TheScrasse | 159 |
5 | maroonrk | 154 |
6 | nor | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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.
Name |
---|