1041 Be Unique (20分)

最新推荐文章于 2024-10-24 06:11:48 发布

李小白~

最新推荐文章于 2024-10-24 06:11:48 发布

阅读量120

点赞数

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

本文链接：https://blog.csdn.net/qq_40941722/article/details/104328449

版权

PAT（甲级）专栏收录该内容

130 篇文章 10 订阅

订阅专栏

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(\le10^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

代码

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int main(){
    int a[10001], b[100000], n;
    fill(a, a+10001, 0);
    scanf("%d", &n);
    for(int i=0; i<n; i++){
        int t;
        scanf("%d", &t);
        b[i] = t;
        a[t]++;
    }
    int i;
    for(i=0; i<n; i++){
        if(a[b[i]] == 1){
            printf("%d\n", b[i]);
            break;
        }
    }
    if(i == n){
        printf("None\n");
    }
    return 0;
}