PAT 1041 Be Unique [hash]

最新推荐文章于 2024-05-31 13:33:10 发布

原创最新推荐文章于 2024-05-31 13:33:10 发布 · 176 阅读

0 ·

CC 4.0 BY-SA版权

PAT 专栏收录该内容

100 篇文章

订阅专栏

博客介绍了火星独特的彩票规则，即从[1,104]选号，首个选到唯一数字者获胜。还给出了输入规范，包含正整数N及N个投注数字；输出规范为打印获胜数字，无胜者则打印特定内容，并列出了示例输入输出。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Input Specification:

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.

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<stdio.h>

int main()
{
	int n,i,plus[10005]={},a[100005];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
		plus[a[i]]++;
	}
	for(i=0;i<n;i++)
	{
		if(plus[a[i]]==1)
		{
			printf("%d",a[i]);
			break;
		}
	}
	if(i==n) printf("None");
	return 0; 
}