Ignatius and the Princess IV
来源:互联网 发布:皮影客软件 编辑:程序博客网 时间:2024/05/25 16:37
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 11414 Accepted Submission(s): 4512
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<string.h>int a[1000000];int main(){ int n; while(scanf("%d",&n)!=EOF){ memset(a,0,sizeof(a)); int s,max=0,k; for(int i=0;i<n;i++){ scanf("%d",&s); a[s]++; if(max<a[s]) { max=a[s]; k=s; } } printf("%d\n",k); } 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
- c字节对齐
- ffmpeg--avi转码到mp4(aac+h264)源码分享
- 子集生成方法
- 安装程序设置
- 筛选法打印素数表
- Ignatius and the Princess IV
- tomcat+JSP乱码解决
- android 使用wap 联网
- Bitmap 旋转
- 用Android-x86虚拟机加速Android应用的调试
- SQLServer索引的四个高级特性
- actor-based programming与构建大规模扩展性的并行系统
- MFC通过对话框窗口句柄获得对话框对象指针
- WhatFont——Google Chrome字体识别扩展