Ignatius and the Princess IV
来源:互联网 发布:什么叫域名 编辑:程序博客网 时间:2024/05/19 03:47
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 13302 Accepted Submission(s): 5368
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 <iostream>#include <cstdio>#include <cstring>using namespace std;int a[1000000];int main (){ int t,z,i; while(scanf("%d",&t)!=EOF) { memset(a,0,sizeof(a)); bool temp=false; for(i=0;i<t;i++) { scanf("%d",&z); if(temp==true) continue; a[z]++; if(a[z]>=(t+1)/2) { printf("%d\n",z); temp=true; } } } return 0;}或者
#include <iostream>
#include <stdio.h>
#include <map>
using namespace std;
int main ()
{
int t,i,a;
while(scanf("%d",&t)!=EOF)
{map <int,int> m1;
for (i=0;i<t;i++)
{
scanf("%d",&a);
m1[a]++;
}
map<int ,int> ::iterator it;
for(it=m1.begin();it!=m1.end();it++)
{
if((*it).second>=(t+1)/2)
cout<<(*it).first<<endl;
}
}
return 0;
}
#include <stdio.h>
#include <map>
using namespace std;
int main ()
{
int t,i,a;
while(scanf("%d",&t)!=EOF)
{map <int,int> m1;
for (i=0;i<t;i++)
{
scanf("%d",&a);
m1[a]++;
}
map<int ,int> ::iterator it;
for(it=m1.begin();it!=m1.end();it++)
{
if((*it).second>=(t+1)/2)
cout<<(*it).first<<endl;
}
}
return 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
- iOS十进制转62进制
- Concurrency is not Parallelism (it's better)
- 音乐播放器功能的实现,歌词lrc显示,播放过程中来电
- C++ AMP: .Massive Data Parallelism on the GPU with Microsoft's C++ AMP (Accelerated Massive Parallel
- perl Statistics::Descriptive Perl 的统计模块
- Ignatius and the Princess IV
- C#杨辉三角
- 阿里巴巴 2014校招 研发工程师 笔试
- python 脚本学习二
- 机房收费系统总结之6——DataGridView导出为Excel
- 无线pj
- ubuntu使用conky美化监测系统状态
- uC/GUI 下绘制简单的函数图象
- 另类隐藏文件夹