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
xor of array
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
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
ajaygupta007 | 2020-07-24 21:07:47 | 34 | ||
| en1 |
|
ajaygupta007 | 2020-07-24 21:06:34 | 163 | Initial revision (published) |
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
