zoukankan      html  css  js  c++  java
  • 杭电1029--Ignatius and the Princess IV(哈希)

    Ignatius and the Princess IV

    Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32767K (Java/Other)
    Total Submission(s) : 5   Accepted Submission(s) : 2

    Font: Times New Roman | Verdana | Georgia

    Font Size: ← →

    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?

    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

    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

    Sample Output

    3
    5
    1

    Author

    Ignatius.L 
     
    //哈希算法;
     
     1 #include<stdio.h>
     2 #include<string.h>
     3 int hash[1000000];
     4 int main()
     5 {
     6     int t;
     7     while(~scanf("%d",&t))    
     8     {
     9         int i,temp;
    10         memset(hash,0,sizeof(hash));
    11         for(i=0;i<t;i++)
    12         {
    13             int a;
    14             scanf("%d",&a);
    15             hash[a]++;
    16             if(hash[a]>=(t+1)/2)
    17             temp=a; 
    18         }
    19         printf("%d
    ",temp);
    20     }
    21     return 0;
    22 } 
  • 相关阅读:
    php面向对象之构造函数和析构函数
    C#语言基础原理及优缺点
    零零散散学算法之具体解释几种最短路径
    Java解惑七:很多其它类之谜
    《Linux设备驱动开发具体解释(第3版)》进展同步更新
    setsockopt的作用
    全排列算法及实现
    【ASP.NET】怎样使用类创建公共函数,在不同ASP.NET页面间反复调用
    Git经常使用命令以及使用方法
    Ansi,UTF8,Unicode,ASCII编码的差别
  • 原文地址:https://www.cnblogs.com/soTired/p/4575953.html
Copyright © 2011-2022 走看看