zoukankan      html  css  js  c++  java
  • HDOJ_1004_Let the Balloon Rise

    Font Size:

    Problem Description

    Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color and find the result.
    This year, they decide to leave this lovely job to you.

    Input

    Input contains multiple test cases. Each test case starts with a number N (0 < N <= 1000) -- the total number of balloons distributed. The next N lines contain one color each. The color of a balloon is a string of up to 15 lower-case letters.
    A test case with N = 0 terminates the input and this test case is not to be processed.

    Output

    For each case, print the color of balloon for the most popular problem on a single line. It is guaranteed that there is a unique solution for each test case.

    Sample Input

    5
    green
    red
    blue
    red
    red
    3
    pink
    orange
    pink
    0
    

    Sample Output

    red
    pink
    
    AC代码:
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #define Max 1005
    using namespace std;
    
    char a[Max][20];
    int  b[Max];
    
    int main(void)
    {
        //freopen("in.txt","r",stdin);
        int n;
        while(scanf("%d",&n)!=EOF&&n)
        {
            getchar();
            memset(b,0,sizeof(b));
            for(int i=1;i<=n;i++)
                gets(a[i]);
            
            for(int i=1;i<=n;i++)
            {
                for(int j=i+1;j<=n;j++)
                {
                    if(strcmp(a[i],a[j])==0)
                    {
                        b[i]++;
                    }
                }
            }
            
            int max=0,count=1;
            for(int i=1;i<=n;i++)
            {
                if(b[i]>max)
                {
                    max=b[i];
                    count=i;
                }
            }
            
            printf("%s
    ",a[count]);
        }
    
        //fclose(stdin);
        return 0;
    }
  • 相关阅读:
    hadoop 2.7 添加或删除datanode节点
    hadoop HA集群的安装
    Linux-PAM认证
    [Notice]博客地址转移 vitostack.com
    WPF 自定义 MessageBox (相对完善版 v1.0.0.6)
    python2.7 倒计时
    Hadoop Streaming框架使用(二)
    Hadoop错误码速查
    Hadoop Streaming框架使用(一)
    python清空列表的方法
  • 原文地址:https://www.cnblogs.com/phaLQ/p/10030048.html
Copyright © 2011-2022 走看看