Given an array of length N and an integer K. Find the number of pairs (i, j) such that (i != j) and (A[i] xor A[j]) = X, for each X ranging from 0 to K.
Constraints
N <= 1e5
A[i] <= 1e8
K <= 1e5
Example
Input
7
1 1 2 2 3 3 4
4
Output
3 3 3 4 0
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
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 |
Given an array of length N and an integer K. Find the number of pairs (i, j) such that (i != j) and (A[i] xor A[j]) = X, for each X ranging from 0 to K.
Constraints
N <= 1e5
A[i] <= 1e8
K <= 1e5
Example
Input
7
1 1 2 2 3 3 4
4
Output
3 3 3 4 0
I tried finding the editorial for the below problem, but was unable to find one which I could understand. Can someone explain the solution for it?
Given N intervals and Q queries of the form L and R. Find the largest sized interval completely lying inside the query range. 1 <= N, Q, L, R <= 1e6.
Name |
---|