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.
use scanf to read values in c++
Just XOR... :)
If using Sort method use Scanf instead of CIN.
if using cin or cout,set sync_with_stdio(false);
is this possible in java?
same sol TLE in python anyway nice question
ridiculous problem statement !
xor method is easier ....way...
did it in java tle :(
this question is really taught new thing..
|Cluster:||Cube (Intel G860)|
|Languages:||All except: ASM64|