| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Doubt in a question asked in linkedin coding test
You are given two arrays a and b each of size n. For each i (0<=i<n), you have to find smallest 'x' such that
-> x+y = a[i]
-> x^y = b[i] (i.e. x xor y = b[i])
0<=a[i],b[i]<=10^(15)
1<=n<=50
It is possible that there might be no 'x' possible. Would be glad if anyone could help...
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
poerhfsdhfnc_h | 2020-11-11 09:06:51 | 22 | Tiny change: 'x^y = b[i]\n\n0<=a[i' -> 'x^y = b[i] (i.e. x xor y = b[i])\n\n0<=a[i' | |
| en2 |
|
poerhfsdhfnc_h | 2020-11-11 08:49:00 | 10 | ||
| en1 |
|
poerhfsdhfnc_h | 2020-11-11 08:48:39 | 316 | Initial revision (published) |
