PAT甲 1041. Be Unique (20)

最新推荐文章于 2020-02-25 08:23:47 发布

原创最新推荐文章于 2020-02-25 08:23:47 发布 · 300 阅读

0 ·

CC 4.0 BY-SA版权

PAT 专栏收录该内容

39 篇文章

订阅专栏

博客介绍了火星独特的彩票中奖规则，即从[1, 104]选号，首个选到唯一数字者获胜。给出输入格式为包含正整数N及N个投注数字，输出格式为打印获胜数字，无获胜者则输出“None”。

1041. Be Unique (20)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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⁴]. 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⁵) 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:

Sample Input 2:

5 888 666 666 888 888

Sample Output 2:

None

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
	int a[10005],b[100005],n;
while(~scanf("%d",&n))
{
	memset(a,0,sizeof(a));
	for(int i=0;i<n;i++)
	{
		scanf("%d",&b[i]);
		a[b[i]]++;
	}
	int flag=0;
	for(int i=0;i<n;i++)
	{
		if(a[b[i]]<2)
		{
			printf("%d\n",b[i]);
			flag=1;
			break;
		}	
	}
	if(!flag)
		printf("None\n");
}
	return 0;
}