HDOJ 1029 Ignatius and the Princess IV(易题)
来源:互联网 发布:p5.min.js在哪里下载 编辑:程序博客网 时间:2024/05/01 02:07
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 24545 Accepted Submission(s): 10342
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<cstring>using namespace std;int main(){ int n,x,i,t,b[100000]; while(~scanf("%d",&n)) { memset(b,0,sizeof(b)); for(i=1;i<=n;i++) { scanf("%d",&x); b[x]++; if(b[x]>=(n+1)/2) { t=x; } } printf("%d\n",t); } return 0;}
0 0
- HDOJ 1029 Ignatius and the Princess IV(易题)
- 【HDOJ】1029 -> Ignatius and the Princess IV
- hdoj 1029 Ignatius and the Princess IV
- HDOJ 1029 Ignatius and the Princess IV
- HDOJ Ignatius and the Princess IV 1029
- HDOJ 1029 Ignatius and the Princess IV
- hdoj 1029 Ignatius and the Princess IV
- HDOJ 1029 Ignatius and the Princess IV
- hdoj-1029-Ignatius and the Princess IV
- hdoj 1029 Ignatius and the Princess IV
- HDOJ 1029 Ignatius and the Princess IV
- HDOJ 1029 Ignatius and the Princess IV [map]
- HDOJ 1029:Ignatius and the Princess IV 解题报告
- hdoj.1029 Ignatius and the Princess IV 20140809
- HDOJ 1029 Ignatius and the Princess IV 【math】
- hdoj 1029 Ignatius and the Princess IV 【简单】
- HDOJ 1029 Ignatius and the Princess IV (水题)
- 杭电HDOJ 1029 Ignatius and the Princess IV
- ucos ii任务调度的粗糙认识
- 20160310_开创自己的网络文章空间
- Java的反射机制
- iOS自定义进度条
- POJ 2104 K-th Number
- HDOJ 1029 Ignatius and the Princess IV(易题)
- 验证码
- UESTC 1073 秋实大哥与线段树 线段树&&改值与区间和 or 树状数组
- 初探属性的copy、strong 2
- vimdiff 使用笔记
- 数组切割问题
- leetcode 每日一题 263. Ugly Number
- 2016年3月10日设计日志
- 用Qt实现一个桌面弹幕程序(八)-- -- 桌面客户端实现④