hdu 1029
来源:互联网 发布:普通收据打印软件 编辑:程序博客网 时间:2024/05/18 22:51
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 10505 Accepted Submission(s): 4143
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
#include<stdio.h>int hash[10000];int main(){ int n,i,t; while(scanf("%d",&n)!=EOF) { for(i=0;i<10000;i++)hash[i]=0; for(i=1;i<=n;i++) { scanf("%d",&t); hash[t]++; } for(i=1;;i++) if(hash[i]>=(n+2)/2) { printf("%d\n",i); break; } }return 0;}
- hdu 1029
- hdu 1029
- HDU 1029
- hdu 1029
- hdu 1029
- HDU 1029
- HDU 1029
- hdu 1029
- hdu 1029
- hdu 1029
- hdu 1029
- hdu 1029
- HDU 1029
- HDU 1029
- HDU 1029
- hdu 1029
- HDU 1029
- hdu 1029
- linux 下替代 source insight 的强大工具
- Android Fragement学习笔记(三)----PreferenceFragment的使用
- 生产订单标准系统状态
- List泛型集合()
- 尊老爱幼?
- hdu 1029
- 如何将机器学习应用到测试领域
- dojo-散列字面量 数组字面量 函数字面量
- SDK更新時出現的問題 及解決辦法
- warning: unable to bind to property '' on class 'Object' (class is not an IEventDispatcher)
- Listview滚动时出现java.lang.StackOverflowError错误
- 如何对分布式系统进行测试
- netfilter简介
- qt 事务操作