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 <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
	int n;
	while(~scanf("%d",&n))
	{ 	
		int no[10010]={0},num[100010],flag=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&num[i]);
			no[num[i]]++;
		}
		for(int i=0;i<n;i++)
		{
			if(no[num[i]]==1)
			{
				printf("%d\n",num[i]);
				flag=1;
				break;
			}
		}
		if(flag==0&&n!=0)
			printf("None\n");
	}
	return 0;
}