1041 Be Unique

1041 Be Unique （20 分)

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<bits/stdc++.h> using namespace std;#define e exp(1) #define p acos(-1) #define mod 1000000007 #define inf 0x3f3f3f3f #define ll long long #define ull unsigned long long #define mem(a,b) memset(a,b,sizeof(a)) int gcd(int a,int b){return b?gcd(b,a%b):a;}int num[10005]; int a[100005]; int main() {int n;scanf("%d",&n);for(int i=0; i<n; i++){scanf("%d",&a[i]);num[a[i]]++;}for(int i=0; i<n; i++){if(num[a[i]]==1){printf("%d\n",a[i]);return 0;}}printf("None\n");return 0; }

 

总结

以上是生活随笔为你收集整理的1041 Be Unique的全部内容，希望文章能够帮你解决所遇到的问题。

如果觉得生活随笔网站内容还不错，欢迎将生活随笔推荐给好友。