HDOJ Ignatius and the Princess IV 1029
来源:互联网 发布:电脑连接不上网络 编辑:程序博客网 时间:2024/05/01 02:31
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 18458 Accepted Submission(s): 7450
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
#include<stdio.h>int main(){int n;while(scanf("%d",&n)!=EOF){int count=0,num,a;for(int i=0;i<n;i++){scanf("%d",&a);if(count==0){num=a;count++;}else if(num!=a)count--;else if(num==a)count++;}printf("%d\n",num);}}
0 0
- 【HDOJ】1029 -> Ignatius and the Princess IV
- hdoj 1029 Ignatius and the Princess IV
- HDOJ 1029 Ignatius and the Princess IV
- HDOJ Ignatius and the Princess IV 1029
- HDOJ 1029 Ignatius and the Princess IV
- hdoj 1029 Ignatius and the Princess IV
- HDOJ 1029 Ignatius and the Princess IV
- hdoj-1029-Ignatius and the Princess IV
- hdoj 1029 Ignatius and the Princess IV
- HDOJ 1029 Ignatius and the Princess IV
- HDOJ 1029 Ignatius and the Princess IV [map]
- HDOJ 1029:Ignatius and the Princess IV 解题报告
- hdoj.1029 Ignatius and the Princess IV 20140809
- HDOJ 1029 Ignatius and the Princess IV 【math】
- hdoj 1029 Ignatius and the Princess IV 【简单】
- HDOJ 1029 Ignatius and the Princess IV (水题)
- HDOJ 1029 Ignatius and the Princess IV(易题)
- 杭电HDOJ 1029 Ignatius and the Princess IV
- KMP简单应用
- android系统去除和增加启动导航页
- CodeForces#285 div.2 题解
- poj 2891 Strange Way To Express Integers(线性同余方程组)
- java读取项目中配置文件的几种方法
- HDOJ Ignatius and the Princess IV 1029
- 数字图像处理,自适应中值滤波的C++实现
- python 多线程就这么简单
- Shell脚本及Python的一些用法
- CentOS Linux解决Device eth0 does not seem to be present
- 处理java非正常的线程终止
- setCellTest
- 14、Longest Common Prefix
- Struts2中过滤器和拦截器的区别