PAT A 甲级 1041 Be Unique (20分)

最新推荐文章于 2024-07-14 02:48:45 发布

虚境

最新推荐文章于 2024-07-14 02:48:45 发布

阅读量103

点赞数

分类专栏： PAT习题

本文链接：https://blog.youkuaiyun.com/qq_39837806/article/details/104150452

版权

PAT习题专栏收录该内容

49 篇文章

订阅专栏

1041 Be Unique (20分)

吐槽

简单题。没啥多说的，贴代码了事。

代码

#include<iostream>
#include<queue>

using namespace std;

int main()
{
	int n;
	cin >> n;
	int num[10000]{ 0 };
	int i;
	queue<int> people;
	int temp;
	for (i = 0; i < n; i++)
	{
		cin >> temp;
		num[temp]++;
		people.push(temp);
	}
	while (!people.empty())
	{
		temp = people.front();
		if (num[temp] == 1)
		{
			cout << temp;
			cin >> i;
			return 0;
		}
		people.pop();
	}
	cout << "None";
	return 0;
}

题目

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
4
]. 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
5
) 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:
31

Sample Input 2:
5 888 666 666 888 888

Sample Output 2:
None