Ignatius and the Princess IV

点击打开链接
 

Ignatius and the Princess IV

[b]Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32767 K (Java/Others)

Total Submission(s): 11265    Accepted Submission(s): 4460
[/b]

[align=left]Problem Description[/align]
"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?

 

 
[align=left]Input[/align]
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.

 

 
[align=left]Output[/align]
For each test case, you have to output only one line which contains the special number you have found.

 

 
[align=left]Sample Input[/align]

5
1 3 2 3 3
11
1 1 1 1 1 5 5 5 5 5 5
7
1 1 1 1 1 1 1

 

 
[align=left]Sample Output[/align]

3
5
1

 

 
[align=left]Author[/align]
Ignatius.L
 
终于明白哈希算法是什么意思了。
 

#include<stdio.h>
#include<string.h>
int main()
{
int n,hash[50000],tem,i,j;
while(scanf("%d",&n)!=EOF)
{
memset(hash,0,sizeof(hash));
for(i=1;i<=n;i++)
{
scanf("%d",&tem);
hash[tem]++;
if(hash[tem]>=(n+1)/2)

j=tem;
}
printf("%d\n",j);
}
return 0;
}