6112 Problem C Be Unique (20)

问题 C: Be Unique (20)
时间限制: 1 Sec 内存限制: 32 MB
献花: 64 解决: 39
[献花][花圈][TK题库]
题目描述
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 <fstream>
#include <algorithm>
using namespace std;

const int MaxN = 100001;

int main()
{
#ifdef _DEBUG
    ifstream 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();
    system("pause");
#endif // _DEBUG

    return 0;
}
/**************************************************************
    Problem: 6112
    User: Sharwen
    Language: C++
    Result: 升仙
    Time:81 ms
    Memory:2368 kb
****************************************************************/