1041 Be Unique

最新推荐文章于 2022-11-30 08:36:14 发布

原创最新推荐文章于 2022-11-30 08:36:14 发布 · 521 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#pat #数据

PAT (Advanced Level) 专栏收录该内容

68 篇文章

订阅专栏

本文介绍了一种在火星上流行的独特彩票系统，该系统通过选取唯一数字的方式确定中奖者。文章详细阐述了输入输出规范，并提供了一个使用C++实现的具体示例程序，帮助读者理解如何找出第一个出现的独特数字。

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<stdio.h>
#include<vector>
#include<string.h>
using namespace std;
int main(){
	int count[10005];
	int n = 0;
	for (; scanf("%d", &n) != EOF;){
		memset(count, 0, sizeof(int)* 10005);
		vector<int>numbers;
		for (int i = 0; i < n; i++){
			int in;
			scanf("%d", &in);
			numbers.push_back(in);
			count[in]++;
		}
		bool flag = 0;
		int index = 0;
		for (index = 0; index < numbers.size(); index++){
			if (count[numbers[index]] == 1){
				flag = 1;
				break;
			}
		}
		if (flag){
			cout << numbers[index] << endl;
		}
		else{
			cout << "None" << endl;
		}
	}
	return 0;
}