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 | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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 |
---|