http://codeup.cn/problem.php?cid=100000582&pid=2
问题 C: Be Unique (20)
时间限制: 1 Sec 内存限制: 32 MB
提交: 212 解决: 118
[提交][状态][讨论版][命题人:外部导入]
题目描述
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.
输入
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.
输出
For each test case, print the winning number in a line. If there is no winner, print "None" instead.
样例输入
7 5 31 5 88 67 88 17
5 888 666 666 888 888
样例输出
31
None
#include <iostream>
#include <cstring>
using namespace std;
const int nmax=1e4+10;
const int nmaxx=1e5+10;
int num[nmaxx];
int hashtable[nmax];
int main(int argc, char** argv) {
int n;
while(cin>>n){
//int num[n];
//int hashtable[nmax];
memset(num,0,sizeof(num));
memset(hashtable,0,sizeof(hashtable));
for(int i=0;i<n;i++){
cin>>num[i];
hashtable[num[i]]++;
}
int flag=0;
for(int i=0;i<n;i++){
if(hashtable[num[i]]==1){
cout<<num[i]<<endl;
flag=1;
break;
}
}
if(!flag){
cout<<"None"<<endl;
}
}
return 0;
}