hdu 1029 Ignatius and the Princess IV
来源:互联网 发布:五星缩水软件安卓版 编辑:程序博客网 时间:2024/04/28 23:08
Problem Description
"OK, you are not too bad, em... But you can never pass the next test." feng5166 says.
"I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to tell me which integer is the special one after I tell you all the integers." feng5166 says.
"But what is the characteristic of the special integer?" Ignatius asks.
"The integer will appear at least (N+1)/2 times. If you can't find the right integer, I will kill the Princess, and you will be my dinner, too. Hahahaha....." feng5166 says.
Can you find the special integer for Ignatius?
"I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to tell me which integer is the special one after I tell you all the integers." feng5166 says.
"But what is the characteristic of the special integer?" Ignatius asks.
"The integer will appear at least (N+1)/2 times. If you can't find the right integer, I will kill the Princess, and you will be my dinner, too. Hahahaha....." feng5166 says.
Can you find the special integer for Ignatius?
Input
The input contains several test cases. Each test case contains two lines. The first line consists of an odd integer N(1<=N<=999999) which indicate the number of the integers feng5166 will tell our hero. The second line contains the N integers. The input is terminated by the end of file.
Output
For each test case, you have to output only one line which contains the special number you have found.
Sample Input
51 3 2 3 3111 1 1 1 1 5 5 5 5 5 571 1 1 1 1 1 1
Sample Output
351这道题主要就是统计元素的个数并寻找到其中满足的元素;
#include<iostream>#include<cstdio>#include<string>#include<algorithm>#include<cstring>#include<set>#include<map>using namespace std;int num[1000000];int main(){ int n,t; set<int> s; map<int,int> m; while(scanf("%d",&n)!=EOF) { int ans; s.clear(); m.clear(); t=(n+1)/2; //找出各个元素 for(int i=0;i<n;++i) { scanf("%d",&num[i]); s.insert(num[i]); } //统计各个元素的个数,找到满足条件的元素 for(int i=0;i<n;++i) { ++m[num[i]]; if(m[num[i]]>=t) { ans=num[i]; break; } } printf("%d\n",ans); } return 0;}
0 0
- hdu 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- Ignatius and the Princess IV hdu 1029
- hdu 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- HDU-1029-Ignatius and the Princess IV
- HDU--1029--Ignatius and the Princess IV
- hdu - 1029 -Ignatius and the Princess IV
- tiny-cnn开源库的使用(MNIST)
- HDU 5610 暴力枚举
- ZOJ 1006 的代码
- Androd 模拟键盘、鼠标事件(adb shell 实现)
- Java 基础——类的加载
- hdu 1029 Ignatius and the Princess IV
- 51Nod 1499 进制转化问题。
- 数据挖掘学习笔记-决策树算法浅析(含Java实现)
- uva11549
- C++builder调用存储过程
- Shape的属性介绍及使用
- 经典大数据架构案例:酷狗音乐的大数据平台重构
- MySQL 远程连接丢失
- java.time时间/日期API