（甲）1041 Be Unique (20 分)

本文主要是介绍（甲）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

题意：

给你一个数字N，后面跟着N个数字，让你找出来第一个没有重复的数字，然后输出来；

如果不存在就输出None；

代码如下：

#include<stdio.h>
#include<string>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;int n,m;
int a[10010];//存储出现的数字出现的次数；
int b[100010];//存储书有的数据；int main()
{while(~scanf("%d",&n)){memset(a,0,sizeof a);memset(b,0,sizeof b);for(int i=0; i<n; i++){scanf("%d",&b[i]);a[b[i]]++;//出现的次数增加；}int flag=0;for(int i=0; i<n; i++){if(a[b[i]]==1)//这个数字出现，且出现了一次（即没有重复）；{flag=1;printf("%d\n",b[i]);break;}}if(flag==0)printf("None\n");}return 0;
}

 

这篇关于（甲）1041 Be Unique (20 分)的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---