首页 > 试题广场 >

Be Unique (20)

[编程题]Be Unique (20)
  • 热度指数：2989 时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 64M，其他语言128M
  • 算法知识视频讲解
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, 104 ]. 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.

输入描述:
Each input file contains one test case.  Each case contains a line which begins with a positive integer N (<=105) and then followed by N bets.  The numbers are separated by a space.


输出描述:
For each test case, print the winning number in a line.  If there is no winner, print "None" instead.
示例1

输入

7 5 31 5 88 67 88 17

输出

31
算法知识视频讲解
开通博客

暂无题解

问题信息

查找 排序
难度：
27条回答 11168浏览

热门推荐

通过挑战的用户

相关试题

Be Unique (20)

扫一扫，把题目装进口袋

求职之前，先上牛客

扫描二维码，进入QQ群

扫描二维码，关注牛客公众号