PAT练习 Be Unique

最新推荐文章于 2022-03-01 16:06:52 发布

Vik1ll

最新推荐文章于 2022-03-01 16:06:52 发布

阅读量189

点赞数

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

本文链接：https://blog.csdn.net/weixin_45388452/article/details/107433806

版权

PAT 专栏收录该内容

62 篇文章 0 订阅

订阅专栏

PAT练习 Be Unique

Description

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, 104]. 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

Each input file contains one test case. Each case contains a line which begins with a positive integer N (<=105) and then followed by N bets. The numbers are separated by a space.

Output

For each test case, print the winning number in a line. If there is no winner, print "None" instead.

Sample Input

7 5 31 5 88 67 88 17
5 888 666 666 888 888

Sample Output

31
None

C++实现

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <map>
using namespace std;

int main(){
    int n,nums[10010];
    int flag;
    map<int,int> mp;
    scanf("%d",&n);
    flag=-1;
    memset(nums, 0, sizeof(nums));
    for(int i=0;i<n;i++){
        scanf("%d",&mp[i]);
        nums[mp[i]]++;
    }
    for(map<int,int>::iterator it=mp.begin();it!=mp.end();it++){
        if(nums[it->second]==1){
            flag=it->second;
            break;
        }
    }
    if(flag>=0){
        printf("%d\n",flag);
    }else{
        printf("None\n");
    }
    mp.clear();
}