HDU-1029-Ignatius and the Princess IV
来源:互联网 发布:广东省软件企业评估 编辑:程序博客网 时间:2024/06/08 18:11
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)
Total Submission(s): 33890 Accepted Submission(s): 14704
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
#include<cstdio>#include<algorithm>using namespace std;const int IN=10000000;int p[IN];int main(){long long int n,i,j,k;while(~scanf("%lld",&n)){k=1;for(i=1;i<=n;i++){scanf("%d",&p[i]);}sort(p,p+n);j=p[0];for(int i=1;i<=n;i++){if(k>=(n+1)/2){break;}else{if(p[i]==j){k+=1;}else{j=p[i];}}}printf("%d\n",j);}return 0;}
51 3 2 3 3111 1 1 1 1 5 5 5 5 5 571 1 1 1 1 1 1
351
#include<cstdio>#include<algorithm>using namespace std;const int IN=10000000;int p[IN];int main(){long long int n,i,j,k;while(~scanf("%lld",&n)){k=1;for(i=1;i<=n;i++){scanf("%d",&p[i]);}sort(p,p+n);j=p[0];for(int i=1;i<=n;i++){if(k>=(n+1)/2){break;}else{if(p[i]==j){k+=1;}else{j=p[i];}}}printf("%d\n",j);}return 0;}
阅读全文
0 0
- hdu 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- Ignatius and the Princess IV hdu 1029
- hdu 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- HDU-1029-Ignatius and the Princess IV
- HDU--1029--Ignatius and the Princess IV
- hdu - 1029 -Ignatius and the Princess IV
- 最长递增子序列(模板)
- JZOJ1218. 黑匣子(2017年8月B组)
- angularjs实现table增加tr
- Struts2源代码查看
- wx.ClientDC在窗口最小化之后所画内容消失的问题探讨
- HDU-1029-Ignatius and the Princess IV
- 刷题——Fence Repair POJ
- 教你如何使用Linux做开机自动运行【树莓派】
- Linux ALSA声卡驱动之一:ALSA架构简介
- 暑假集训 第N天 T2 Number
- mysql中的时间戳和日期时间的转换
- HDU 2888 Check Corners 二维RMQ模板
- 竞争神经网络
- 动态规划