PAT 1041. Be Unique (20)

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

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

0 ·

CC 4.0 BY-SA版权

浙大PAT解题报告专栏收录该内容

29 篇文章

订阅专栏

本文介绍了一种在火星上流行的独特彩票算法，该算法通过选取第一个出现的独特数字作为中奖号码。输入为一系列数字，输出为首个独一无二的数字，若没有唯一数字则输出None。示例展示了具体操作流程。

摘要生成于 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 "iostream"
#include "vector"
#include "cstring"
#include "string"
#include "stack"
#include "algorithm"
using namespace std;

int main() {
	int cnt[10001];
	int a[100001];
	int n;
	memset(cnt, 0, sizeof(cnt));
	cin >> n;
	for (int i = 0; i < n; i++) {
		int t;
		cin >> a[i];
		cnt[a[i]]++;
	}
	int i;
	for ( i = 0; i < n; i++)
		if (cnt[a[i]] == 1) {
			cout << a[i] << endl;
			break;
		}
	if (i == n)
		cout << "None" << endl;
	return 0;
}