标签：
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 17Sample Output 1:
31Sample Input 2:
5 888 666 666 888 888Sample Output 2:
None
1 #include<cstdio> 2 #include<algorithm> 3 #include<iostream> 4 #include<cstring> 5 #include<queue> 6 #include<vector> 7 #include<cmath> 8 #include<string> 9 #include<map> 10 #include<set> 11 using namespace std; 12 int num[10005]; 13 int main(){ 14 int n; 15 scanf("%d",&n); 16 memset(num,0,sizeof(num)); 17 vector<int> v; 18 int i,in; 19 for(i=0;i<n;i++){ 20 scanf("%d",&in); 21 num[in]++; 22 v.push_back(in); 23 } 24 for(i=0;i<v.size();i++){ 25 if(num[v[i]]==1){ 26 break; 27 } 28 } 29 if(i==v.size()){ 30 printf("None\n"); 31 } 32 else{ 33 printf("%d\n",v[i]); 34 } 35 return 0; 36 }
标签：
原文地址：http://www.cnblogs.com/Deribs4/p/4770307.html
