how to count numbers of pairs in array of size n whose xor is equal than x for each value of 0<=x<=k ? 1<=n<=100000 1<=a[i]<=100000000 1<=k<=100000
how to count numbers of pairs in array of size n whose xor is equal than x for each value of 0<=x<=k ? 1<=n<=100000 1<=a[i]<=100000000 1<=k<=100000
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | BledDest | 145 |
You can just google before posting here. Here
for each value of x between 0 to k this approach take O(n*n) time. please see constraint.
Is this from some ongoing contest? Provide the link