Let the Balloon Rise 【HDU - 1004 】

最新推荐文章于 2022-07-15 08:45:00 发布

原创最新推荐文章于 2022-07-15 08:45:00 发布 · 204 阅读

CC 4.0 BY-SA版权

本文介绍了一个简单的编程问题，即在程序竞赛中统计最受欢迎的问题所对应的气球颜色。通过输入一系列颜色字符串并计数，程序输出出现次数最多的颜色。

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

题解：

找出出现次数最多的颜色，先输入一个颜色，如果后面的与前面相同，+1.

代码：

#include <stdio.h>
#include <string.h>
int main()
{
    int n,num[1000],maxx=0,t=0;
    char c[1000][16];
    while(~scanf("%d",&n))
    {
        if(n)
        {
            num[0]=0;
            scanf("%s",c[0]);
            for(int i=1; i<n; i++)
            {
                num[i]=0;
                scanf("%s",c[i]);
                for(int j=0; j<i-1; j++)
                    if(strcmp(c[i],c[j])==0)
                        num[i]+=1;
            }
            maxx=0;
            t=0;
            for(int i=1; i<n; i++)
                if(maxx<num[i])
                {
                    maxx=num[i];
                    t=i;
                }
            printf("%s\n",c[t]);
        }
    }
    return 0;
}