<PREV Problem:
NEXT>
Solved by 2089 users: ...
UserDateAttemptTimeCMSC
xtender05 may 2010Perl1100.775 
Nakilon05 jun 2010Ruby1701.4516 
xtender05 may 2010Perl700.6618 
kronos13 sep 2009Ruby300.7320 
V.A.KeRneL12 nov 2006Ruby400.7320 
Nakilon05 jun 2010Ruby1601.0620 
samonon21 nov 2008Ruby301.1020 
sb3ar12 dec 2007Ruby1001.1820 
lacrosse19 sep 2013Ruby1801.2820 
zhuojie22 dec 2008Python302.4920 
barlukov09 dec 2009Kylix500.1022 
mishko-00706 nov 2012Perl900.3122 
Languages
C++
964
FPC
494
C
389
Java
144
Kylix
75
Ruby
35
Python
26
Perl
7
Lua
5
Scheme
4
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 

Odd number

Time limit = 5 seconds

Memory limit = 2000 K

Input First line contains positive integer N < 500000 then, N positive integers follow (delimited with space) each less than 1 000 000.

Output In input sequence only one number X is repeated odd times. Others have even number of occurences. You should output X.

Input#1
9
3 1 2 2 17 1 3 17 3
Output#1
3
Input#2
5
12 13 14 13 12
Output#2
14

Author:

<PREV | Problem set | Search related messages | NEXT>


© acm.mipt DevGroup
The page was generated in 230ms

SW soft NIX
ID = 3.228.220.31