HDU 1029(鸽巢原理)
来源:互联网 发布:爱淘宝网商城 编辑:程序博客网 时间:2024/05/20 05:53
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 28525 Accepted Submission(s): 12081
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>#include<stdlib.h>#include<string.h>#include<math.h>#include<queue>#include<iostream>#include<algorithm>using namespace std;int main(){//利用鸽巢原理 int n;int a,c,x;while(~scanf("%d",&n)){c=0;while(n--){scanf("%d",&a);if(c==0)//每次是零就更新{x=a;c++;}else if(a==x)//再次遇到这个数就++ {c++;}else//如果不是这个数就-- {c--;}}printf("%d\n",x);//因为是(N+1)/2个,所以最后肯定会省一个 }return 0;}
0 0
- HDU 1029(鸽巢原理)
- hdu 1205 鸽巢原理
- HDU 1808(鸽巢原理)
- Hdu 1029 Ignatius and the Princess IV (鸽巢原理)
- HDU 5776 SUM (鸽巢原理 / 抽屉原理)
- hdu 1205 吃糖果(鸽巢原理)
- hdu 5776 sum (鸽巢原理)
- HDU 1205(鸽巢原理)
- 鸽巢原理 Poj3370&Hdu1808 + Poj2356 + Hdu 1205
- [ACM] hdu 1205 吃糖果(鸽巢原理)
- HDU 1205 吃糖果(组合数学鸽巢原理)
- [HDU 1664] Different Digits DFS+鸽巢原理
- HDU 1205.吃糖果【鸽巢原理】【8月1】
- hdu 1205 吃糖果(鸽巢原理)
- POJ 3370 && HDU 1808 Halloween treats(鸽巢原理)
- HDU 1808.Halloween treats【鸽巢原理】【11月25】
- HDU 1205 吃糖果(鸽巢原理)
- HDU——1205吃糖果(鸽巢原理)
- Zookeeper——3、使用zkClient操作zookeeper
- Kth Smallest Element in a BST
- 预处理标识符:__FILE__ __TIME__ __DATE__ __LINE__ ;#以及##的区别
- OKVIS IMU 误差公式版本
- java-20161203基础总结
- HDU 1029(鸽巢原理)
- 区块链-以太坊学习资料汇总
- Imooc_Java实现Base64加密_2-1实现Base64算法
- zookeeper+dubbo
- 微信开发教程:用户账号绑定到微信公众号的方法分享
- GDB调试命令以及GDB调试段错误
- ascii码
- 单链表头插法赋值
- 39. Combination Sum