Can you give me a some trick for xor( exclusive or ) operation?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
Can you give me a some trick for xor( exclusive or ) operation?
| Name |
|---|



Here you go! http://en.wikipedia.org/wiki/XOR_swap_algorithm
Given an array of positive integers. Let's assume that every value except one repeat an even number of times. The question is: find the only value that repeats an odd number of times.
For example, if the array is:
6 8 8 6 3 9 3 9 3the answer is 3, because it repeats an odd number of times.For the solution, see "Rev. 1" of this comment :)
Here you can find some tricks for bit operations http://graphics.stanford.edu/~seander/bithacks.html