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). |
Input
First line of input contains number of pyanis N <= 500 000. Next N lines contain a single positive integer 1 <= Pi <= 10^9.
Output
Output one positive integer on pyani, which appeared once.
Example
Input:
3
1
8
1
Output: 8
Onotole has found not optimal AC algorithms, so all solutions will be rejudged. He is watching you.
hide comments
|
ianand:
2016-05-27 16:26:46
Please
|
|
ragwave:
2016-05-22 19:32:24
time limit is very strict so use scanf and printf! |
|
sahilagg06:
2016-05-08 15:54:52
use scanf instead of cin. |
|
achi_9629:
2016-05-04 14:53:01
good question learned something new |
|
rohittt:
2016-04-30 21:50:45
requires a quite long line of code for java :( |
|
lalit_nit:
2016-04-23 13:15:32
O(N+NlogN) gives TLE .... :( .. int is enough ...learnt something new |
|
sharif ullah:
2016-04-20 14:32:20
O(N+logN) works! |
|
pamyjeela:
2016-04-16 18:53:25
Thanks geek4geeks |
|
Santosh Kumar Shaw:
2016-04-07 15:46:32
Done using only XOR operator. |
|
aboalmanal2000:
2016-03-31 17:22:00
easy with sorting |
| Added by: | Efim |
| Date: | 2010-11-04 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
RSS