PAT甲级 1041 Be Unique (20 分)

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

原创最新推荐文章于 2024-07-14 02:48:45 发布 · 122 阅读

0 ·

CC 4.0 BY-SA版权

PAT甲级专栏收录该内容

79 篇文章

订阅专栏

博客介绍了火星独特的彩票规则，即从[1,104]选号，首个选到唯一数字者获胜。还给出了输入规范，包含正整数N及N个投注数字，输出规范为打印获胜数字，无胜者则打印特定内容，并列举了示例输入输出。

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 <unordered_map>

using namespace std;
int number[100005];

int main() {
    int N;
    unordered_map<int, int> unorderedMap;
    cin >> N;
    for (int i = 0; i < N; ++i) {
        cin >> number[i];
        if (!unorderedMap.count(number[i]))
            unorderedMap[number[i]] = 1;
        else
            unorderedMap[number[i]]++;
    }
    for (int i = 0; i < N; ++i) {
        if (unorderedMap[number[i]] == 1) {
            cout << number[i];
            return 0;
        }
    }
    cout << "None";
    return 0;
}