hdoj.1029 Ignatius and the Princess IV 20140809
来源:互联网 发布:好看的鲨鱼电影知乎 编辑:程序博客网 时间:2024/05/01 04:43
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)
Total Submission(s): 16886 Accepted Submission(s): 6777
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<stdio.h>#include<string.h>int num[1000000];int main(){ int n,i,a,x; while(scanf("%d",&n)!=EOF) { memset(num,0,sizeof(num)); for(i=0;i<n;i++) { scanf("%d",&a); num[a]++; if(num[a]>=(n+1)/2) x=a; } printf("%d\n",x); } 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 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 20140809
- HDOJ 1029 Ignatius and the Princess IV [map]
- HDOJ 1029:Ignatius and the Princess IV 解题报告
- 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(易题)
- 杭电HDOJ 1029 Ignatius and the Princess IV
- mac FastScripts
- Android深入探究笔记之二十 -- 广播接收者,BroadcastReceiver
- 我的保险生涯系列-1
- 黑马程序员-io流
- 旅游指南下龙湾在越南
- hdoj.1029 Ignatius and the Princess IV 20140809
- 蟒蛇比Perl的的优点与缺点
- springMvc如何和前端页面交互,传输json数据
- leetcode-reverse words in a string
- 线程异常
- 黑马程序员-位与进制转换
- 文件内存映射mmap解决大文件快速读写问题和进程间共享内存
- linux进程通信(一)--共享内存+信号量,代码示例
- poj 2488 A Knight's Journey (Dfs)