Can you give me a some trick for xor( exclusive or ) operation?
# | 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 | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
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 3
the 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