1041. Be Unique

标签：c++   pat   

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.

#include <stdio.h>
#include <stdlib.h>
int main ()
{
    int n,temp,i;
    int num[100001],time[10001]={0};
    scanf("%d",&n);
    
    for( i=0;i<n;i++)
    {
         scanf("%d",&temp);
         num[i]=temp;;
         time[temp]++;
         }
    for( i=0;i<n;i++)
    {
         if( time[num[i]]==1) 
         {
             printf("%d\n",num[i]);
             return 0;
             }
         }
    printf("None\n");
    system("pause");
    return 0;
    }

1041. Be Unique

标签：c++   pat   

原文地址：http://blog.csdn.net/lchinam/article/details/44080047