PAT A1041 Be Unique (20 分)

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

信不信我是机智狗

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

阅读量93

点赞数

分类专栏： PAT 记录文章标签：算法数据结构

本文链接：https://blog.csdn.net/weixin_48165493/article/details/113873801

版权

PAT 同时被 2 个专栏收录

76 篇文章 0 订阅

订阅专栏

记录

75 篇文章 0 订阅

订阅专栏

PAT A1041 Be Unique (20 分)

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
以下是AC的代码：

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int maxn = 10010;
const int maxn1 = 100100;
int bets[maxn],num[maxn1]={0};
int main(void){
	int n;
	memset(bets,-1,sizeof(bets));
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",&num[i]);
		bets[num[i]]++;
	}
	bool iswinner=false;
	for(int i=0;i<n;i++){
		if(bets[num[i]] == 0){
			iswinner=true;
			printf("%d",num[i]);
			break;
		}
	}
	if(!iswinner) printf("None");
	return 0;
}