6112 Problem C Be Unique (20)

问题 C: Be Unique (20)

时间限制: 1 Sec  内存限制: 32 MB

题目描述

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.

样例输入

7 5 31 5 88 67 88 17
5 888 666 666 888 888

样例输出

31
None

经验总结

题意为输入一行数，求其中是否有唯一的数，并输出第一个唯一存在的数，数的大小在1到10^4，可以开一个10^4的数组实现，难度不大~~

AC代码

#include 
#include 
#include 
using namespace std;
int main()
{
	int n;
	while(~scanf("%d",&n))
	{ 	
		int no[10010]={0},num[100010],flag=0;
		for(int i=0;i