1041. Be Unique (20)

最新推荐文章于 2021-07-10 17:41:34 发布

原创最新推荐文章于 2021-07-10 17:41:34 发布 · 313 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #PAT #1041. Be Unique

C/C++ 同时被 2 个专栏收录

7 篇文章

订阅专栏

PAT(Basic Level)

2 篇文章

订阅专栏

博客介绍火星独特的彩票规则，即第一个押注唯一数字者获胜。给出输入输出规格，输入包含正整数 N 及 N 个押注数字，要求输出获胜数字，若无则输出“None”，可能涉及 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 <cstdio>
#include <vector>

using namespace std;

#define MAX_NUM 10001

int hist[MAX_NUM];

int main(){
	int n;
	scanf("%d", &n);

	fill_n(hist, MAX_NUM, 0);
	vector<int> input;

	for(int i = 0; i < n; ++i){
		int num;
		scanf("%d", &num);
		hist[num]++;
		input.push_back(num);
	}

	for(int i = 0; i < n; ++i){
		if(hist[input[i]] == 1){
			cout << input[i];
			return 0;
		}
	}

	cout << "None";

	return 0;
}