【HDU
来源:互联网 发布:崩坏3新版矩阵buff 编辑:程序博客网 时间:2024/06/05 08:39
点击打开链接
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 34363 Accepted Submission(s): 14971
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>const int maxn = 1e6 + 10;int a[maxn] ;int main(){int n,k;while(~scanf ("%d",&n)) { int ans = 0; for (int i = 1 ; i <= n ; i++) { scanf ("%d",&k); a[k]++; if (a[k] >= (n+1) / 2) ans = k; }printf ("%d\n",ans); }return 0;}
阅读全文
0 0
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- JavaScript中8个常见的陷阱
- Nginx学习总结(9)——前端跨域问题解决
- UVA437
- 修改时间戳为 年-月-日格式
- python官方文档(自翻译)
- 【HDU
- From Inception to Xception
- JAVA,同级包下的类引用不需要import
- 线性回归模型及其分析
- jenkins bat 命令
- 行内元素与块级元素
- 更改placeholder的默认颜色
- MATLAB的getstart入门手册学习(启航篇)
- Android开机启动APP广播