You are given three integers ,$$$A$$$ , $$$B$$$ , and $$$C$$$, and your task is to apply bitwise XOR ($$$oplus$$$) on the $$$A$$$,$$$B$$$,$$$C$$$ such that they transform into non-decreasing order? Also A,B,C lie in the range from 1 to 1e9.
How to Solve this XOR Problem??
You are given three integers ,$$$A$$$ , $$$B$$$ , and $$$C$$$, and your task is to apply bitwise XOR ($$$oplus$$$) on the $$$A$$$,$$$B$$$,$$$C$$$ such that they transform into non-decreasing order? Also A,B,C lie in the range from 1 to 1e9.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
D-Day | 2024-09-05 13:30:21 | 26 | Tiny change: 'he $A$,$B$,$C$ such t' -> 'he $A$,$B$ and $C$ such t' (published) | |
| en2 |
|
D-Day | 2024-09-05 13:28:09 | 10 | Tiny change: 'twise XOR ($oplus$) on the $A' -> 'twise XOR on the $A' | |
| en1 |
|
D-Day | 2024-09-05 13:27:36 | 243 | Initial revision (saved to drafts) |
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 8 | maroonrk | 133 |
| 10 | qwexd | 130 |
