1041 Be Unique （20 分) (hash散列)

最新推荐文章于 2025-06-17 00:12:36 发布

小火汁猛猛

最新推荐文章于 2025-06-17 00:12:36 发布

阅读量235

点赞数 1

CC 4.0 BY-SA版权

分类专栏： c++ 甲级文章标签： PAT

本文链接：https://blog.youkuaiyun.com/qq_42068614/article/details/86632519

c++ 同时被 2 个专栏收录

115 篇文章

订阅专栏

甲级

92 篇文章

订阅专栏

博客介绍了火星独特的彩票中奖规则，即第一个押注唯一数字者获胜。给出了输入输出规格，包含正整数N及N个押注数字，需输出获胜数字，若无则输出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 <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <cctype>
#include <string.h>
#include <cstdio>
using namespace std;
int a[100100],m[100100];
int main(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a[i];
        m[a[i]]++;
    }
    for(int i=0;i<n;i++){
        if(m[a[i]]==1) {
            cout<<a[i];
            return 0;
        }
    }
    cout<<"None";
    return 0;
}