Let the Balloon Rise

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

weixin_34192993

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

阅读量54

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/orchidzjl/p/4262847.html

当比赛结束时，裁判们最期待的是找到最受欢迎的气球颜色。今年，他们决定将这个可爱的任务交给你。通过输入不同颜色的气球数量，你需要找出哪种颜色的气球最受欢迎。

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

Author

WU, Jiazhi

#include<cstdio>
#include<cstring>
int main()
{
    char s[1005][20];
    char temp[20];
    int a[1005];
    int n,i,j;
    while(1)
    {
        memset(a,0,sizeof(a));
        memset(temp,0,sizeof(temp));
        memset(s,0,sizeof(s));
        scanf("%d",&n);
        if(!n) break;
        for(i=0; i<n; i++)
            scanf("%s",s[i]);
        for(i=0; i<n-1; i++)
        {
            if(a[i]<0) continue;/*不这样做就会超时*/
            for(j=i+1; j<n; j++)
            {
                if(a[j]<0) continue;
                if(strcmp(s[i],s[j])==0)
                {
                    a[i]++;
                    a[j]=-1;
                    strcpy(s[j],temp);
                }

            }
        }
        int max=0,maxi=0;
        for(i=0; i<n; i++)
            if(a[i]>max)
            {
                max=a[i];
                maxi=i;
            }
        printf("%s\n",s[maxi]);


    }
}