zoukankan      html  css  js  c++  java
  • HDU1029--Ignatius and the Princess IV

    Ignatius and the Princess IV
    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)
    Total Submission(s): 12501 Accepted Submission(s): 5000


    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<cstdio>
     2 #include<string>
     3   
     4 int hash[1000001];
     5   
     6 int main()
     7 {
     8     int n;
     9     while(scanf("%d",&n)!=EOF)
    10     {
    11         int num;
    12         memset(hash,0,sizeof(hash));
    13         while(n--)
    14         {
    15             scanf("%d",&num);
    16             hash[num]++;
    17         }
    18         int i;
    19         int max=-1;
    20         for(i=1;i<=1000000;i++)
    21         {
    22             if(max<hash[i])
    23             {
    24                 max=hash[i];
    25                 num=i;
    26             }
    27         }
    28         printf("%d
    ",num);
    29     }
    30     return 0;
    31 }
    View Code
  • 相关阅读:
    mysql: 多时区的聚合统计
    机器学习实例---3.2、朴素贝叶斯之新浪新闻分类
    机器学习实例---3.1、朴素贝叶斯基础
    机器学习实例---2.1、决策树(实战)
    python的pickle模块
    机器学习实例---2.1、决策树(介绍)
    如何计算熵
    sklearn库简单介绍
    机器学习实例---1.3、k-近邻算法(数字识别)
    理解ThreadPoolExecutor线程池的corePoolSize、maximumPoolSize和poolSize
  • 原文地址:https://www.cnblogs.com/zafuacm/p/3185223.html
Copyright © 2011-2022 走看看