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.
time limit is very strict so use scanf and printf!
use scanf instead of cin.
good question learned something new
requires a quite long line of code for java :(
O(N+NlogN) gives TLE .... :( .. int is enough ...learnt something new
Santosh Kumar Shaw:
Done using only XOR operator.
easy with sorting
simple sort method accepted :|
|Cluster:||Cube (Intel G860)|
|Languages:||All except: ASM64|