mirror of
https://github.com/xlucn/PAT.git
synced 2026-10-30 00:37:37 +08:00
27 lines
1.1 KiB
HTML
27 lines
1.1 KiB
HTML
<!DOCTYPE html>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
|
|
<h1>1041. Be Unique (20)</h1>
|
|
<div id="problemContent">
|
|
<p>Being unique is so important to people on Mars that even their lottery is designed in a unique way. The rule of winning is simple: one bets on a number chosen from [1, 10<sup>4</sup>]. The first one who bets on a unique number wins. For example, if there are 7 people betting on 5 31 5 88 67 88 17, then the second one who bets on 31 wins.</p>
|
|
<p><b>
|
|
Input Specification:
|
|
</b></p>
|
|
<p>Each input file contains one test case. Each case contains a line which begins with a positive integer N (<=10<sup>5</sup>) and then followed by N bets. The numbers are separated by a space.</p>
|
|
<p><b>
|
|
Output Specification:
|
|
</b></p>
|
|
<p>For each test case, print the winning number in a line. If there is no winner, print "None" instead.
|
|
</p>
|
|
<b>Sample Input 1:</b><pre>
|
|
7 5 31 5 88 67 88 17
|
|
</pre>
|
|
<b>Sample Output 1:</b><pre>
|
|
31
|
|
</pre>
|
|
<b>Sample Input 2:</b><pre>
|
|
5 888 666 666 888 888
|
|
</pre>
|
|
<b>Sample Output 2:</b><pre>
|
|
None
|
|
</pre>
|
|
</div> |