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.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
2 | cry | 160 |
4 | nor | 156 |
4 | atcoder_official | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 153 |
7 | adamant | 153 |
9 | Um_nik | 152 |
10 | djm03178 | 146 |
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 |
![]() |
fighterphoenix | 2024-09-05 13:30:21 | 26 | Tiny change: 'he $A$,$B$,$C$ such t' -> 'he $A$,$B$ and $C$ such t' (published) | |
en2 |
![]() |
fighterphoenix | 2024-09-05 13:28:09 | 10 | Tiny change: 'twise XOR ($oplus$) on the $A' -> 'twise XOR on the $A' | |
en1 |
![]() |
fighterphoenix | 2024-09-05 13:27:36 | 243 | Initial revision (saved to drafts) |
Name |
---|