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
    java获取系统指定时间年月日
    JS获取系统的指定定年月日
    nodetree中 前面复选框禁用插件
    JS生成指定长度的随机数
    Post的请求案例
    Ajax的简单请求案例
    from 表单提交
    Oracle中添加视图
    java double保留小数点的零的问题,java保留小数点问题
  • 原文地址:https://www.cnblogs.com/phaLQ/p/10030048.html
Copyright © 2011-2022 走看看