1041. Be Unique (20)
时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B
判题程序 Standard 作者 CHEN, Yue
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 17
Sample Output 1:
31
Sample Input 2:
5 888 666 666 888 888
Sample Output 2:
None
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstring>
#include <fstream>
#include <string>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
const int MaxN = 100001;
int main()
{
#ifdef _DEBUG
freopen("data.txt", "r+", stdin);
//fstream cin("data.txt");
#endif // _DEBUG
int N, Num, data[MaxN], NC, index;
while (cin >> N)
{
int Table[MaxN] = { 0 };
NC = 0;
while (N--)
{
cin >> Num;
data[NC++] = Num;
++Table[Num];
}
for (index = 0; index < NC; ++index)
{
if (Table[data[index]] == 1)
{
printf("%d\n", data[index]);
break;
}
}
if (index == NC)
printf("None\n");
}
#ifdef _DEBUG
//cin.close();
#ifndef _CODEBLOCKS
std::system("pause");
#endif // !_CODEBLOCKS
#endif // _DEBUG
return 0;
}