1041

最新推荐文章于 2020-05-17 10:47:30 发布

比锅

最新推荐文章于 2020-05-17 10:47:30 发布

阅读量271

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT

本文链接：https://blog.youkuaiyun.com/czh1075208140/article/details/79911628

PAT 专栏收录该内容

43 篇文章

订阅专栏

博客介绍了火星独特的彩票规则，即从[1, 104]选号，首个选到唯一数字者获胜。给出输入输出规范，输入包含正整数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, 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 Specification:

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

using namespace std;

int unique[10001];
int num[10010];

int main()
{
    int n,temp,ni=0;
    scanf("%d", &n);
    for(int i=0;i<n;i++)
    {
        scanf("%d", &temp);
        if(unique[temp] == 0)
            num[ni++] = temp;   
        unique[temp]++;
    }
    int i;
    for(i=0;i<ni;i++)
    {
        if(unique[num[i]] == 1)
        {
            printf("%d", num[i]);
            break;
        }
    }
    if(i==ni)
        cout << "None";

    return 0;
}