6112 Problem C Be Unique (20)

最新推荐文章于 2020-10-20 17:13:11 发布

漫浸天空的雨色

最新推荐文章于 2020-10-20 17:13:11 发布

阅读量690

点赞数 1

CC 4.0 BY-SA版权

分类专栏： codeup 文章标签： Be Unique 6112 codeup C++

本文链接：https://blog.csdn.net/a845717607/article/details/89429872

codeup 专栏收录该内容

153 篇文章

订阅专栏

博客围绕Be Unique问题展开，该问题要求输入一行数，找出其中第一个唯一存在的数并输出，若不存在则输出“None”。解题可通过开一个10^4的数组实现，难度不大，还给出了AC代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

问题 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到10^4，可以开一个10^4的数组实现，难度不大~~

AC代码

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
	int n;
	while(~scanf("%d",&n))
	{ 	
		int no[10010]={0},num[100010],flag=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&num[i]);
			no[num[i]]++;
		}
		for(int i=0;i<n;i++)
		{
			if(no[num[i]]==1)
			{
				printf("%d\n",num[i]);
				flag=1;
				break;
			}
		}
		if(flag==0&&n!=0)
			printf("None\n");
	}
	return 0;
}