PAT1041. Be Unique

标签：

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

思路：哈希，水题

 1 #include <iostream>
 2 
 3 using namespace std;
 4 int people[100010];
 5 int     number[10010]={
 6     0
 7 };
 8 int main(int argc, char *argv[])
 9 {
10     int N;
11     scanf("%d",&N);
12     for(int i=0;i<N;i++)
13     {
14         scanf("%d",&people[i]);
15         int index=people[i];
16         number[index]++;
17     }
18     bool flag=false;
19     for(int i=0;i<N;i++)
20     {
21         int tem=people[i];
22         if(number[tem]==1)
23         {
24             flag=true;
25             printf("%d\n",tem);
26             break;
27         }
28     }
29     if(!flag)
30       printf("None\n");
31     return 0;
32 }

View Code

PAT1041. Be Unique

标签：

原文地址：http://www.cnblogs.com/GoFly/p/4291871.html