OLOLO - Onotole needs your help
Onotole has a lot of pyani. Each pyani has a number, writing on it. Pyanis with equal numbers are indistinguishable. Onotole knows everything, so, he knows that each pyani appeared twice, and only one pyani is unique. He wants to get вздръжни эффект, and he needs the unique pyani. Given the list of pyanis denote which one of them appeared once (it is guaranteed that other pyanis appeared twice).
First line of input contains number of pyanis N <= 500 000. Next N lines contain a single positive integer 1 <= Pi <= 10^9.
Output one positive integer on pyani, which appeared once.
Onotole has found not optimal AC algorithms, so all solutions will be rejudged. He is watching you.
the concept of taking xor of all the elements will be used!!
Xor and scanf works good!!
Just use Fast I/O n u will get AC
A very nice problem .!
never realised XOR has such a cool use, good one
THE POWER OF XOR
Don't using cin, cout, even with optimal algorithm this result in TLE
first time used XOR in a problem
Better add JAVA to your list of unsupported languages.
|Cluster:||Cube (Intel G860)|
|Languages:||All except: ASM64|