PAT 1041 Be Unique [hash]

本文主要是介绍PAT 1041 Be Unique [hash]，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

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,10​4​​]. 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 (≤10​5​​) 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<stdio.h>int main()
{int n,i,plus[10005]={},a[100005];scanf("%d",&n);for(i=0;i<n;i++){scanf("%d",&a[i]);plus[a[i]]++;}for(i=0;i<n;i++){if(plus[a[i]]==1){printf("%d",a[i]);break;}}if(i==n) printf("None");return 0; 
}

 

这篇关于PAT 1041 Be Unique [hash]的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---