| Submit | All submissions | Best solutions | Back to list |
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.
| Added by: | Efim |
| Date: | 2010-11-04 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
hide comments
|
||||||||||||||
|
2018-12-22 07:11:33 Lucky Rathore
on using "cin" its time limit exceed and on "scan" it shows AC... its crazy |
||||||||||||||
|
2018-12-19 17:06:18
the concept of taking xor of all the elements will be used!! int result=0; result ^= arr[i] (while running the loop from i=0 to n-1) |
||||||||||||||
|
2018-08-25 14:16:25
Xor and scanf works good!! |
||||||||||||||
|
2018-08-23 16:11:38
easy problem |
||||||||||||||
|
2018-08-12 16:30:09
Just use Fast I/O n u will get AC |
||||||||||||||
|
2018-07-04 13:29:43
A very nice problem .! isn'T that esay as it looks. ;) |
||||||||||||||
|
2018-07-03 21:13:45
never realised XOR has such a cool use, good one |
||||||||||||||
|
2018-05-30 16:14:41
THE POWER OF XOR |
||||||||||||||
|
2018-04-18 07:47:36
Don't using cin, cout, even with optimal algorithm this result in TLE |
||||||||||||||
|
2018-03-18 15:31:43
first time used XOR in a problem |
||||||||||||||
RSS