Q.Find the number of pairs in the array whose bitwise AND is greater then K?
Size of Array: N=5*(10^5)
Elements in Array: (10^9)>=a[i]>=1
Range for K: (10^9)>=K>=0
Expected Time Complexity: O(N) or O(NlogN)
№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
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 |
Help In Interview Problem
Q.Find the number of pairs in the array whose bitwise AND is greater then K?
Size of Array: N=5*(10^5)
Elements in Array: (10^9)>=a[i]>=1
Range for K: (10^9)>=K>=0
Expected Time Complexity: O(N) or O(NlogN)
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | triggered_ | 2020-12-25 16:03:16 | 243 | Initial revision (published) |
Название |
---|