HDOJ 1004 Let the Balloon Rise

最新推荐文章于 2021-05-21 21:48:24 发布

原创最新推荐文章于 2021-05-21 21:48:24 发布 · 526 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#HDOJ #ACM

HDU OJ 专栏收录该内容

21 篇文章

订阅专栏

本文介绍了一个用于统计编程竞赛中各题目受欢迎程度的程序。该程序读取多种颜色的气球作为输入，输出出现次数最多的气球颜色，以此判断最受欢迎的问题。

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

传送门

#include<iostream>
#include<string>
using namespace std;

int main()
{
    int N,i,j,count,max,color;
    char a[1001][16];
    while(cin>>N&&N!=0)
    {
        getchar();
        max=1;
        for(i=0;i<N;i++)
        {
            gets(a[i]);
        }
        for(i=0;i<N;i++)
        {
            count=1;
            if(a[i][0]=='\0')
                continue;
            for(j=i+1;j<N;j++)
            {
                if(a[j][0]=='\0')
                    continue;
                if(strcmp(a[i],a[j])==0)
                {
                    count++;
                    a[j][0]='\0';
                }
            }
            if(count>max)
            {
                max=count;
                color=i;
            }

        }
        puts(a[color]);

    }
}