当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1563:Find your present!

题目描述
In the new year party, everybody will get a "special present".Now it's your turn to get your special present, a lot of presents now putting on the desk, and only one of them will be yours.Each present has a card number on it, and your present's card number will be the one that different from all the others.For example, there are 5 present, and their card numbers are 1, 2, 3, 2, 1.so your present will be the one with the card number of 3, because 3 is the number that different from all the others.
输入解释
The input file will consist of several cases.
Each case will be presented by an integer n (1<=n<=200, and n is odd) at first. Following that, n positive integers will be given in a line. These numbers indicate the card numbers of the presents.n = 0 ends the input.
输出解释
For each case, output an integer in a line, which is the card number of your present.
输入样例
5
1 1 3 2 2
3
1 2 1
0
输出样例
3
2
来自杭电HDUOJ的附加信息
Author 8600
Recommend 8600

该题目是Virtual Judge题目,来自 杭电HDUOJ

题目来源 Happy 2007

源链接: HDU-1563

最后修改于 2020-10-25T22:46:03+00:00 由爬虫自动更新

共提交 399

通过率 73.93%
时间上限 内存上限
1000/1000MS(Java/Others) 32768/32768K(Java/Others)