1041. Be Unique (20)

最新推荐文章于 2021-07-10 17:41:34 发布

原创最新推荐文章于 2021-07-10 17:41:34 发布 · 306 阅读

0 ·

CC 4.0 BY-SA版权

PATA 专栏收录该内容

55 篇文章

订阅专栏

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

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1041. Be Unique (20)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

const int N = 100010;

int main() {
    int n;
    int cnt[N] = {0};
    int ary[N];
    scanf("%d", &n);

    for (int i = 0; i < n; ++i) {
        scanf("%d", ary + i);
        if (ary[i] >= 1 && ary[i] <= 10000)
            ++cnt[ary[i]];
    }

    bool flag = false;
    for (int i = 0; i < n; ++i) {
        if (ary[i] >= 0 && ary[i] <= 10000 && cnt[ary[i]] == 1) {
            printf("%d\n", ary[i]);
            flag = true;
            break;
        }
    }

    if (flag == false)
        puts("None");
    return 0;
}