hdu1029 Ignatius and the Princess IV
来源:互联网 发布:手机桌面软件管理 编辑:程序博客网 时间:2024/05/29 04:07
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 24905 Accepted Submission(s): 10480
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
We have carefully selected several similar problems for you: 1074 1028 1171 1203 1087
因为至少要出现(n+1)/2次 所以肯定只有一个数~原因自己想想
#include <stdio.h>#include <string.h>int num[999999];int main(){int n,m;while(~scanf("%d",&n)){memset(num,0,sizeof(num));int m=(n+1)/2,result;for(int i=0;i<n;i++){int x;scanf("%d",&x);if(++num[x]>=m)result=x;}printf("%d\n",result);}return 0;}
0 0
- HDU1029:Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV
- HDU1029-Ignatius and the Princess IV
- hdu1029 B - Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV
- HDU1029 Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV 水题
- HDU1029:Ignatius and the Princess IV
- HDU1029 Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV
- Ignatius and the Princess IV||HDU1029
- HDU1029-Ignatius and the Princess IV
- 【hdu1029 】Ignatius and the Princess IV
- HDU1029——Ignatius and the Princess IV
- HDU1029----Ignatius and the Princess IV(map实现)
- hdu1029 Ignatius and the Princess IV——多数元素
- hdu1029 Ignatius and the Princess IV(DP求数列中出现次数过半的数)
- 关于Android中so的符号表导出以及C++的符号改编规则
- java实现DES数据加密与解密
- need improve 43. Multiply Strings
- 邮件协议学习
- public private protected
- hdu1029 Ignatius and the Princess IV
- 数组简单实现单向链表
- mysql中文乱码解决
- flask 电子邮件
- PHP之页面跳转
- linux shell 使用
- Android性能优化之一:ViewStub(转)
- mysql索引总结----mysql 索引类型以及创建
- 点击空白处隐藏软键盘