HDU1029:Ignatius and the Princess IV
来源:互联网 发布:qq三国修复数据 编辑:程序博客网 时间:2024/05/29 04:34
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
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<iostream>#include<string.h>using namespace std;int main(){ int n,i; int t; int cnt; int result; while(scanf("%d",&n)!=EOF) { cnt=0; for(i=0;i<n;i++) { scanf("%d",&t); if(cnt==0) { cnt=1; result=t; } else { if(t==result)cnt++; else cnt--; } } 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求数列中出现次数过半的数)
- 矩阵转置与矩阵相乘
- 二维数组和指针数组
- 什么是jsonp
- 你需要知道的枚举类
- 【VS开发】error C2220: 警告被视为错误 - 没有生成“object”文件
- HDU1029:Ignatius and the Princess IV
- poj1160 Post Office
- C语言可变参数
- 关于Service中的耗时操作
- Android_sdk目录结构详解
- ASP.NET服务器控件的生命周期
- iPhone回滚APP的方法
- Aggregate方法
- spring in action 第3章