PAT.A1041. Be Unique

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

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

0 ·

CC 4.0 BY-SA版权

本文介绍了一种在火星上流行的独特彩票系统，该系统通过选取唯一数字的方式确定中奖者。文章详细解释了输入输出规范，并提供了一个C++实现示例，展示了如何处理大量投注并确定是否有中奖号码。

摘要生成于 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, 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 <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
using namespace std;
int main(){
	int hash[10010] = { 0 }, a[100010] = { 0 };
	int n,i;
	scanf("%d", &n);
	for (int i = 1; i <=n; i++) {
		int b;
		scanf("%d", &b);
		a[b] = i;
		hash[b]++;
	}
	int max = 100010,k;
	for (int i = 1; i <=10000; i++) {
		if (hash[i] == 1) {
			if (a[i] < max) {
				max = a[i];
				k = i;
			}
				
		}
	}
	if (max == 100010) printf("None");
	else
		printf("%d", k);
	
	return 0;
}