1041. Be Unique

1041. Be Unique (20)

时间限制100 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueBeing 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. Forexample, 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 17

Sample Output 1:

31

Sample Input 2:

5 888 666 666 888 888

Sample Output 2:

None

#include<iostream>#include<string.h>#include<vector>using namespace std;int flag[10002];int main(){int n;cin>>n;memset(flag, 0, sizeof(flag));vector<int> v;v.clear();for(int i = 0; i < n; i ++){int tmp;cin>>tmp;v.push_back(tmp);flag[tmp] ++;}for(int i = 0; i < n; i ++)if(flag[v[i]] == 1){cout<<v[i]<<endl;return 0;}cout<<"None"<<endl;return 0;}

[/code]