PAT-PAT (Advanced Level) PractiseBe Unique (20) 【一星级】

原创 2015年11月19日 21:47:59

题目链接:http://www.patest.cn/contests/pat-a-practise/1041


题面:

1041. Be Unique (20)

时间限制
100 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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.

Input Specification:

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.

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
题目大意:

给定一数列,求出其中第一个仅出现一次的数,没有则输出"None"。


代码:

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;
int cnt[10010],ori[100010];
int main()
{
    int n;
    cin>>n;
    bool flag=true;
    memset(cnt,0,sizeof(cnt));
    for(int i=1;i<=n;i++)
    {
    	cin>>ori[i];
    	cnt[ori[i]]++;
    }
    for(int i=1;i<=n;i++)
    {
    	if(cnt[ori[i]]==1)
  	    {
    	   cout<<ori[i]<<endl;
    	   flag=false;
		   break;  	
  	    }
    }
    if(flag)cout<<"None\n"; 
	return 0;
} 


版权声明:欢迎交流!

PAT-PAT (Advanced Level) Practise 1011. World Cup Betting (20) (套公式) 【一星级】

题目链接:http://www.patest.cn/contests/pat-a-practise/1011 题面: 1011. World Cup Betting (20) ...

1096. Consecutive Factors (20)——PAT (Advanced Level) Practise

题目信息1096. Consecutive Factors (20)时间限制400 ms 内存限制65536 kB 代码长度限制16000 B Among all the factors of ...

1011. World Cup Betting (20)——PAT (Advanced Level) Practise

题目信息: 1011. World Cup Betting (20) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 ...

PAT (Advanced Level) Practise 1061 Dating (20)

1061. Dating (20) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B ...

PAT (Advanced Level) 1035. Password (20) 解题报告

To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem ...

【PAT (Advanced Level)】1058. A+B in Hogwarts (20)

1058. A+B in Hogwarts (20) 时间限制 50 ms 内存限制 32000 kB 代码长度限制 16000 B...

PAT (Advanced Level) 1011. World Cup Betting (20) 求最大期望值,简单题

With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excite...

PAT (Advanced Level) Practise 1073 Scientific Notation (20)

1073. Scientific Notation (20) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16...

【PAT (Advanced Level)】1008. Elevator (20)

1008. Elevator (20) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B ...

1081. Rational Sum (20)【模拟】——PAT (Advanced Level) Practise

题目信息1081. Rational Sum (20)时间限制400 ms 内存限制65536 kB 代码长度限制16000 B Given N rational numbers in the ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:PAT-PAT (Advanced Level) PractiseBe Unique (20) 【一星级】
举报原因:
原因补充:

(最多只允许输入30个字)