Ignatius and the Princess IV
来源:互联网 发布:高级研修班 知乎 编辑:程序博客网 时间:2024/05/25 16:38
点击打开链接
点击打开链接
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 33605 Accepted Submission(s): 14508
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
*****
题意:求一列数中出现次数最多的那个数*****
c代码
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a[1000000];int b[1000000];int main(){int n,ans,sum;while(~scanf("%d",&n)){sum=1;memset(b,0,sizeof(b));for(int i=0;i<n;i++)scanf("%d",&a[i]);sort(a,a+n);for(int i=1;i<n;i++){if(a[i]==a[i-1]){sum++;if(sum>=(n+1)/2){ans=a[i];break;}}elsesum=1;}printf("%d\n",ans);}return 0;}
阅读全文
0 0
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- 小白成长记——Java基础之数据类型
- memcpy
- spring mvc架构
- 数据挖掘一般流程(数据清洗,特征提取,建模,调参)
- 如何使用JavaScript在静态页面插入PDF文件(附带效果图)?
- Ignatius and the Princess IV
- layer.open组件获取弹出层页面变量、函数
- 复杂clone
- 如何在Debian和Ubuntu下重新打包Deb文件
- 框架学习系列 mybatis 第八篇 mybatis开发dao的方式
- jenkins 启动参数 大全
- delete和truncate的区别
- 如何进行字符串解析,并打印需要的字符串
- java基础学习