6112 Problem C Be Unique (20)

質問C:Be Unique(20)
時間制限:1 Secメモリ制限:32 MB
タイトルの説明
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

経験の総括
1行の数を入力して、その中に唯一の数があるかどうかを求めて、そして最初の唯一の存在の数を出力して、数の大きさは1から10^4で、1つの10^4の配列を開いて実現することができて、難易度は大きくありません~~
ACコード

#include 
#include 
#include 
using namespace std;
int main()
{
	int n;
	while(~scanf("%d",&n))
	{ 	
		int no[10010]={0},num[100010],flag=0;
		for(int i=0;i