HDU 1029 Ignatius and the Princess IV 水题
来源:互联网 发布:sql 多个case when 编辑:程序博客网 时间:2024/06/07 21:53
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 34827 Accepted Submission(s): 15205
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
Author
Ignatius.L
Recommend
如果你会map容器,就成了水题,
ac代码:
#include <cstdio>#include <iostream>#include <cmath>#include <cstring>#include <string>#include <algorithm>#include <map>using namespace std;int n;int main(){while(~scanf("%d",&n)){map<int,int> mmp;int tmp;for(int i=1;i<=n;i++){scanf("%d",&tmp);mmp[tmp]++;}map<int,int>::iterator it;int ane=(n+1)/2;int flag=0;for(it=mmp.begin();it != mmp.end();it++){if(it-> second >= ane){if(!flag){cout << it->first;flag=1;}else{cout << " "<< it->first;}}}if(flag)cout << endl;}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
- 超级读入挂
- Shiro异常:java.lang.IllegalArgumentException: Line argument must contain a key and a value. Only one
- ubuntu Qt5环境变量设置
- 足球赛确定淘汰赛名单-map<string, int>问题
- 在网页上动态显示当前时间
- HDU 1029 Ignatius and the Princess IV 水题
- Java导入Excel数据方法
- 删除列表中重复值1
- 【XSY1596】旅行 期望DP
- java中常见的I/O流总结
- 【python】类、类兑现和实例对象
- ztree使用心得
- 读书笔记:机器学习实战【第7章:利用Adaboost元算法提高分类性能】
- linux curl工具