PAT甲级 -- 1041 Be Unique (20 分)

2024-05-23 18:41:34

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:

Sample Input 2:

5 888 666 666 888 888

Sample Output 2:

None

AC：

#include <iostream>
#include <cmath>
#include <vector>
using namespace std;int n;
struct number
{int id, num;
}nn;
int mx = -1;
bool flag = false;
int arr[100000+5] = {0}, num;
vector<number> v;int main()
{scanf("%d", &n);for(int i = 0; i < n; i++){scanf("%d", &num);nn.id = i;nn.num = num;v.push_back(nn);arr[num] += 1;}for(int i = 0; i < v.size(); i++){if(arr[v[i].num] == 1){printf("%d", v[i].num);flag = true;break;}}if(!flag) printf("None");return 0;
}

刚开始打算用数字下标记录，忽略了顺序，后面改为vector，ok了

PAT甲级 -- 1041 Be Unique (20 分)相关推荐

【PAT (Advanced Level) Practice】1041 Be Unique (20 分)
1041 Be Unique (20 分) Being unique is so important to people on Mars that even their lottery is desi ...
【题意+解析】1041 Be Unique (20 分)_18行代码AC
立志用最少的代码做最高效的表达 PAT甲级最优题解-->传送门 Being unique is so important to people on Mars that even their lo ...
PAT甲级 -- 1050 String Subtraction (20 分)
Given two strings S1 and S2, S=S1−S2 is defined to be the remaining string after taking ...
【PAT甲级 LinkedHashMap】1041 Be Unique (20 分) Java、C++版
题目题目的意思是,找到第一个不重复的元素.输出它. 一开始用Java做,试了好多种方法都超时.后来换用C++通过了. AC题解:C++版用Java尝试了各种方式,都是后两个测试点过不去,只好换C+ ...
PAT甲级1041 Be Unique ：[C++题解]模拟、哈希表
文章目录题目分析题目链接题目分析来源:acwing 分析:统计次数,按序遍历,输出第一个出现次数为1的号码. ac代码 #include<bits/stdc++.h> using ...
【PAT甲级】11077 Kuchiguse (20 分) Java
题目 Java题解(最后一个测试用例没通过) import java.io.BufferedReader; import java.io.IOException; import java.io.Inp ...
PAT 甲级 1108 Finding Average (20 分)
思路: 1.不是数字的位置只能在第一个且为负号,或者在字符串的倒数第一.二.三位置.或者不存在: 2.上面的方法也可以用sscanf或者sprintf进行判定: 3.数字要在规定区间内: 4.按.2f ...
C++ PAT甲级 1050 String Subtraction (20分)
Given two strings S1 and S2, S=S1−S2is defined to be the remaining string aftertaking all the cha ...
PAT甲级1100 Mars Numbers (20 分)题解
\quad这个题稍微有点麻烦,需要分别处理数字转火星文和火星文转数字两种情况.不过数字最高两位,处理起来分别讨论即可.程序如下: #include <iostream> using nam ...

最新文章

热门文章