B - Ignatius and the Princess IV——POJ
2016-05-11 20:35
381 查看
B - Ignatius and the Princess IV
Time Limit:1000MS Memory Limit:32767KB 64bit IO Format:%I64d
& %I64u
Submit Status
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?
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
Sample Output
Time Limit:1000MS Memory Limit:32767KB 64bit IO Format:%I64d
& %I64u
Submit Status
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?
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
5 1 3 2 3 3 11 1 1 1 1 1 5 5 5 5 5 5 7 1 1 1 1 1 1 1
Sample Output
3 5 1
#include<stdio.h> long a[1000000]; int main() { long n,i,t,re; while(scanf("%ld",&n)!=EOF) { for(i=0;i<n;i++) { scanf("%ld",&t); a[t]++; if(a[t]>=(n+1)/2) { re=t; } } printf("%ld\n",re); } }
相关文章推荐
- 第十一周项目1.2— 点 圆 圆柱类族的设计
- B-树和B+树的应用:数据搜索和数据库索引
- 【模仿】对双机调试的学习
- C++第五次作业
- selenium的config.ini
- Apache服务器笔记
- LeetCode:Number of 1 Bits
- Objective-C中@property的所有属性详解
- bnuoj 20950 沉重的货物 (最小生成树)
- poj 2812 恼人的青蛙(枚举+剪枝)
- acm_数塔问题
- C语言深度剖析——读书笔记
- 数据库字符串函数
- 反射机制--获取Class中的方法
- android中播放本地raw下的文件
- Linux串口编程(中断方式和select方式)
- ELFHash算法解释
- Deep Learning(深度学习)
- MySQL5.7 利用keepalived来实现mysql双主高可用方案的详细过程
- vim 2