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.
this problem teaches you the use of xor(^) operator
Even if you write O(nlogn) solution it will get accepted using fast I/O.
learnt a vry gud concept frm ths Q.... :)
Man , int and xor are enough ! O(1) space is enough !
Taught me to use xor and %llu
what is the point of having such problems if you want people to use Fast I/O? :3
easy problem ,if ur facing TLE use scanf and printf instead cin and cout ,if ur using c++
Learned to use xor.AC in many goes;p
just use xor as x^x=0 and x^0=x
Unlike most other problems, do not put a newline at the end of your answer... it will count as wrong.
|Cluster:||Cube (Intel G860)|
|Languages:||All except: ASM64|