Solved by 1509 users: ...| User | Date | Attempt | Time | CM | SC |
|---|
| xtender | 05 may 2010 | Perl | 11 | 00.77 | 5 | | | Nakilon | 05 jun 2010 | Ruby | 17 | 01.45 | 16 | | | xtender | 05 may 2010 | Perl | 7 | 00.66 | 18 | | | kronos | 13 sep 2009 | Ruby | 3 | 00.73 | 20 | | | V.A.KeRneL | 12 nov 2006 | Ruby | 4 | 00.73 | 20 | | | Nakilon | 05 jun 2010 | Ruby | 16 | 01.06 | 20 | | | samonon | 21 nov 2008 | Ruby | 3 | 01.10 | 20 | | | sb3ar | 12 dec 2007 | Ruby | 10 | 01.18 | 20 | | | zhuojie | 22 dec 2008 | Python | 3 | 02.49 | 20 | | | barlukov | 09 dec 2009 | Kylix | 5 | 00.10 | 22 | | | mishik_ruby | 08 oct 2007 | Ruby | 3 | 00.69 | 22 | | | DarthBeleg | 13 aug 2009 | Python | 2 | 01.25 | 22 | |
Languages| C++ | 619 | | FPC | 481 | | C | 227 | | Java | 104 | | Kylix | 72 | | Ruby | 22 | | Python | 22 | | Perl | 6 | | Scheme | 3 | | Lua | 1 | | < < < < < < < < < <
|
|---|
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>