PAT 1041. Be Unique (20)
来源:互联网 发布:共享网络怎么连接 编辑:程序博客网 时间:2024/06/05 22:36
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 17Sample Output 1:
31Sample Input 2:
5 888 666 666 888 888Sample Output 2:
None
/* * 此题略水。 * 午睡操场传来蝉的声音 多少年后也还是很好听~~*/#include "iostream"#include "vector"#include "cstring"#include "string"#include "stack"#include "algorithm"using namespace std;int main() {int cnt[10001];int a[100001];int n;memset(cnt, 0, sizeof(cnt));cin >> n;for (int i = 0; i < n; i++) {int t;cin >> a[i];cnt[a[i]]++;}int i;for ( i = 0; i < n; i++)if (cnt[a[i]] == 1) {cout << a[i] << endl;break;}if (i == n)cout << "None" << endl;return 0;}
0 0
- 【PAT】1041. Be Unique (20)
- 1041. Be Unique (20)-PAT
- PAT 1041. Be Unique (20)
- PAT 1041. Be Unique (20)
- pat 1041. Be Unique (20)
- PAT 1041. Be Unique (20)
- PAT 1041. Be Unique (20)
- PAT 1041. Be Unique (20)
- PAT 1041. Be Unique
- PAT 1041. Be Unique
- pat 1041. Be Unique
- 【PAT】1041. Be Unique
- PAT--1041. Be Unique
- PAT-Be Unique (20)
- PAT (Advanced) 1041. Be Unique (20)
- PAT 1041. Be Unique (20) 【Hash思想】
- PAT A 1041. Be Unique (20)
- PAT甲 1041. Be Unique (20)
- HDF5快速上手全攻略
- 堆排序算法
- 直方图、基数、选择性、群集因子
- php中filter函数验证邮箱、url和ip地址的实例
- DOM对象-节点的操作
- PAT 1041. Be Unique (20)
- 数据结构第二章内容
- loading框
- 微信切换界面延时加载的实现方法是优化ViewPager中加载Fragment
- Medium:Burst Ballons
- C++深复制和浅复制的区别
- java内存配置详解
- “Beyond Compare 许可证密钥被撤销” 的解决办法
- 《ACM程序设计》书中题目X 第二十四题 电话号码