1041. Be Unique

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

31

Sample Input 2:

5 888 666 666 888 888

Sample Output 2:

None

A: 计数排序的应用。

#include<stdio.h>

int main()
{
    int n,i,bet;
    int count[10001]={0};
    int pos[10001]={0};
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&bet);
        count[bet]++;
        if(count[bet]==1)
            pos[bet] = i+1;
    }
    bet = -1;
    for(i=0;i<10001;i++)
    {
        if(count[i]==1&&(bet==-1||pos[i]<pos[bet]))
        {
            bet = i;
        }
    }
    if(bet==-1)
        printf("None\n");
    else
        printf("%d\n",bet);
    return 0;
}

　　

转载于:https://www.cnblogs.com/summer-zhou/p/3176404.html