L - Let the Balloon Rise

最新推荐文章于 2021-02-18 22:40:21 发布

原创最新推荐文章于 2021-02-18 22:40:21 发布 · 113 阅读

CC 4.0 BY-SA版权

本文介绍了一道关于统计比赛中最热门问题所对应的气球颜色的编程题。通过输入一系列颜色字符串并利用双for循环及数组记录每种颜色出现次数的方法，找出出现次数最多的颜色。

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

题解：这是一道字符串题，用两个for循环遍历，再定义一个数组，记录每个字符串出现的次数。

然后找到出现次数最多的字符串，输出来。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
    int n,book[1005],a[1005],i,j;
    char s[1005][20];
    while(~scanf("%d",&n)&&n)
    {
        memset(book,0,sizeof(book));
        memset(a,0,sizeof(a));
        for(i=0; i<n; i++)
        {
            scanf("%s",s[i]);
        }
        for(i=0; i<n; i++)
        {
            if(book[i]==0)
            {
                for(j=i+1; j<n; j++)
                {
                    if(strcmp(s[i],s[j])==0)
                    {
                        a[i]++;
                        book[j]=1;
                    }
                }
            }
        }
        int max=a[0];
        int k=0;
        for(i=1;i<n;i++)
        {
            if(a[i]>max)
            {
                max=a[i];
                k=i;
            }
        }
        printf("%s\n",s[k]);
    }
    return 0;
}