1041 Be Unique （20 分）C语言

 

1041 Be Unique （20 分）

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​4​​]. 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.

Input Specification:

Each input file contains one test case. Each case contains a line which begins with a positive integer N (≤10​5​​) and then followed by N bets. The numbers are separated by a space.

Output Specification:

For each test case, print the winning number in a line. If there is no winner, print None instead.

Sample Input 1:

7 5 31 5 88 67 88 17

Sample Output 1:

31

Sample Input 2:

5 888 666 666 888 888

Sample Output 2:

None

分析

注意运行超时这个梗

代码

#include<stdio.h>
#define Max 100009
int count[Max],key[Max];
int len=0;//next loc
int main(){
	int N,i,j,t;
	scanf("%d",&N);
	for(i=0;i<N;i++){
		scanf("%d",&t);
		if(!count[t]) key[len++]=t;
		count[t]++;
	}
//	for(i=0;i<len;i++)//delete
//		printf("%d 's count: %d\n",key[i],count[ key[i] ]);//delete
	for(i=0;i<len;i++)
		if(count[ key[i] ]==1){
			printf("%d",key[i]);
			return 0;
		}
	printf("None");
}