PAT (Advanced Level) Practice 1041 Be Unique (20 分) 凌宸1642
PAT (Advanced Level) Practice 1041 Be Unique (20 分) 凌宸1642
题目描述:
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.
译:对于火星人来说,成为唯一是很重要的,甚至他们的彩票也是以独特的方式设计的。获胜的规则很简单,对从 区间[1 , 10 4 ] 中选择的一个数字下注。第一个在唯一号码上下注的人就赢了。例如,如果有7个人对{5 31 5 88 67 88 17} 下注,那么第二个下注 31 的人赢。
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.
译:每个输入文件包含一个测试用例,每个用例在一行中包含一个正整数 N (≤10 5 ) , 紧跟着 N 个赌注。所有的数字被一个空格分隔。
Output Specification (输出说明):
For each test case, print the winning number in a line. If there is no winner, print None
instead.
译:对于每个测试用例,在一个行中输出获胜的数字。如果没有获胜者,则输出 None
。
Sample Input 1 (样例输入1):
7 5 31 5 88 67 88 17
Sample Output 1 (样例输出1):
31
Sample Input 2 (样例输入2):
5 888 666 666 888 888
Sample Output 2 (样例输出2):
None
The Idea:
签到题,真的是签到的水题。直接用 map 存储每个数字出现的顺序,然后再遍历数字,判断第一个只出现一次的数字,就是 winner 。 遍历完整个序列之后,如果没有找到只出现一次的数字,则输出 None
。
The Codes:
#include<bits/stdc++.h>
using namespace std;
int num[100010] , n ;
map<int , int > mp ;
int main(){
cin >> n ;
for(int i = 0 ; i < n ; i ++){
cin >> num[i] ;
mp[num[i]] ++ ; // 该数字出现的顺序加 1
}
for(int i = 0 ; i < n ; i ++){
if(mp[num[i]] == 1){
cout << num[i] << endl ;
break;
}
if(i == n - 1) cout << "None" << endl ;
}
return 0 ;
}
PAT (Advanced Level) Practice 1041 Be Unique (20 分) 凌宸1642的更多相关文章
- PAT (Advanced Level) Practice 1046 Shortest Distance (20 分) 凌宸1642
PAT (Advanced Level) Practice 1046 Shortest Distance (20 分) 凌宸1642 题目描述: The task is really simple: ...
- PAT (Advanced Level) Practice 1042 Shuffling Machine (20 分) 凌宸1642
PAT (Advanced Level) Practice 1042 Shuffling Machine (20 分) 凌宸1642 题目描述: Shuffling is a procedure us ...
- PAT (Advanced Level) Practice 1015 Reversible Primes (20 分) 凌宸1642
PAT (Advanced Level) Practice 1015 Reversible Primes (20 分) 凌宸1642 题目描述: A reversible prime in any n ...
- PAT (Advanced Level) Practice 1152 Google Recruitment (20 分)
In July 2004, Google posted on a giant billboard along Highway 101 in Silicon Valley (shown in the p ...
- PAT (Advanced Level) Practice 1120 Friend Numbers (20 分) (set)
Two integers are called "friend numbers" if they share the same sum of their digits, and t ...
- PAT (Advanced Level) Practice 1015 Reversible Primes (20 分)
A reversible prime in any number system is a prime whose "reverse" in that number system i ...
- PAT (Advanced Level) Practice 1035 Password (20 分) 凌宸1642
PAT (Advanced Level) Practice 1035 Password (20 分) 凌宸1642 题目描述: To prepare for PAT, the judge someti ...
- PAT (Advanced Level) Practice 1031 Hello World for U (20 分) 凌宸1642
PAT (Advanced Level) Practice 1031 Hello World for U (20 分) 凌宸1642 题目描述: Given any string of N (≥5) ...
- PAT (Advanced Level) Practice 1027 Colors in Mars (20 分) 凌宸1642
PAT (Advanced Level) Practice 1027 Colors in Mars (20 分) 凌宸1642 题目描述: People in Mars represent the c ...
随机推荐
- PerformanceObserver API All In One
PerformanceObserver API All In One 性能监控 https://developer.mozilla.org/en-US/docs/Web/API/Performance ...
- eyes protect app
eyes protect app https://awaremac.com/
- browser parse CSS style order
browser parse CSS style order 浏览器解析 CSS style 的顺序 从右到左 https://juejin.im/entry/5a123c55f265da432240c ...
- Rust learning notes
Rust learning notes Rust Version 1.42.0 $ curl --proto '=https' --tlsv1.2 -sSf https://sh.rustup.rs ...
- modal 遮罩层,滚动穿透 bug
modal 遮罩层,滚动 穿透bug float 弹层 taro 小程序弹框 滚动击穿 问题 https://segmentfault.com/q/1010000011134345 solution ...
- [转]自动驾驶平台Apollo 2.5环境搭建
原文地址:https://blog.csdn.net/jinzhuojun/article/details/80210180,转载主要方便随时查阅,如有版权要求,请及时联系. 我们知道,自动驾驶在学界 ...
- 获取点击元素的id
1.onclick="dianji(this.id)" 传入id到方法里function dianji(id){ //这个就是id}2. $(document).click(fun ...
- Java基本概念:封装
一.简介 描述: 生活中,我们要看电视,只需要按一下开关和换台就可以了.我们没有有必要了解电视机内部的结构. 制造厂家为了方便我们使用电视,把复杂的内部细节全部封装起来,只给我们暴露简单的接口,比如电 ...
- How DRI and DRM Work
How DRI and DRM Work Introduction This page is intended as an introduction to what DRI and DRM are, ...
- HTTP头Content-Type类型记录
默认发POST格式 Content-Type: application/x-www-form-urlencoded Content-Type: application/x-www-form-urlen ...