1041. Be Unique
来源:互联网 发布:淘宝网太极刀 编辑:程序博客网 时间:2024/05/20 22:37
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 <cstdio>
#include <cstdlib>
#include<iostream>
#include <deque>
#include <queue>
#include <cstring>
#include <vector>
#include<string>
#include <iomanip>
#include<algorithm>
using namespace std;
#define max1 100000
int main()
{
int n;
cin>>n;
int flag=0;
int count1[100001]={0};
vector<int>nums;
for(int i=0;i<n;i++)
{
int a;
cin>>a;
if(count1[a]==0)
nums.push_back(a);
count1[a]++;
}
for(int i=0;i<nums.size();i++)
{
if(count1[nums[i]]==1&&flag==0)
{
cout<<nums[i];
flag=1;
}
}
if(flag==0)
cout<<"None";
return 0;
}
0 0
- 1041. Be Unique
- 1041. Be Unique (20)
- 1041. Be Unique
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- PAT 1041. Be Unique
- PAT 1041. Be Unique
- 1041. Be Unique
- 1041. Be Unique
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041.Be Unique
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique
- 蓝桥杯 算法提高 打水问题 逻辑策略 贪心
- UVA - 1592
- echarts 修改图例legend颜色
- LeetCode 42 --- Trapping Rain Water
- 当两个div无法放在一行的解决办法
- 1041. Be Unique
- 带新手走进神秘的HTTP协议
- 计算机开机后的第一条指令
- 二维通道下输入和输出一个矩阵
- C++函数用法1:回调函数
- Codeforces617E【莫队算法+前缀异或】
- 1042. Shuffling Machine
- 每日170219-20
- ESP(栈顶指针)EBP(栈底指针)