ACM——1029
来源:互联网 发布:java过滤器和拦截器 编辑:程序博客网 时间:2024/05/29 02:44
Ignatius and the Princess IV
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
题目分析:因为必定存在这个数。所以我们可以将所有数排序,这时我们可以发现当有五个数时 为第二个数 当有七个数时 为第三个数(从0开始数)即只要找到排在中间的那个数就可以了
代码如下:
<pre name="code" class="cpp"># include <stdio.h># include <algorithm>using namespace std;int number[999999];int main(){int n, i;while(scanf("%d", &n) != EOF){for(i = 0; i < n; i++){scanf("%d", &number[i]);}sort(number, number + n);i = (n + 1) / 2 - 1;printf("%d\n", number[i]);}return 0;}
0 0
- ACM——1029
- ACM——Java
- 博弈论——acm
- 博弈论——acm
- ACM——1236
- 博弈论——acm
- ACM —— 1007
- 博弈论——acm
- 博弈论——acm
- ACM —— Argus
- 博弈论——acm
- ACM——滑雪
- ACM—课程总结
- ACM 学习心得 ——2014年ACM暑假集训有感
- ACM首战——山东省第八届ACM程序设计比赛
- ACM模板——LCS
- acm——贪心算法
- ACM集训——POJ_1008
- ASP.Net MVC 生成安全验证码
- 求1+2+3+...+n,要求不能使用乘除法、for、while、if、else、switch、case等关键字及条件判断语句(A?B:C)
- 第五周 项目四 静态成员应用
- 第六周项目二我的数组类
- POJ 3664 Election Time
- ACM——1029
- 取代MDK的神器--COIDE
- 模板讲解
- 锋利的JQuery 第三章内容
- iOS-------------主題管家
- ACM——1236
- 【C++】虚函数
- 设计模式之抽象工程模式Abstract Factory Pattern()C++实现
- LS(链路状态)算法及matlab仿真