hdu 1004

最新推荐文章于 2021-06-24 22:53:24 发布

北辰暮雪

最新推荐文章于 2021-06-24 22:53:24 发布

阅读量568

点赞数

分类专栏： OJ 文章标签：杭电 c++

本文链接：https://blog.youkuaiyun.com/u014070944/article/details/25746235

版权

OJ 专栏收录该内容

9 篇文章

订阅专栏

Let the Balloon Rise

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 69548 Accepted Submission(s): 25847

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

Author

WU, Jiazhi

Source

ZJCPC2004

此题虽然很水，由于自己对于字符串掌握实在是弱，第一时间没做出来。C++在处理字符串方面简单方便。

#include<iostream>
#include<string.h>
using namespace std;
int main()
{
    char a[1001][20];// 最大收获，二维数组的运用
    int n,i,j,max,b,c;
    while(cin>>n&&n!=0)
    {
        max=0;
        for(i=0;i<n;i++)
            cin>>a[i];
        for(i=0;i<n;i++)
        {
            b=1;
            for(j=i+1;j<n;j++)
             {
             if(strcmp(a[i],a[j])==0)  b++;
             }
             if(b>max)
             {
                 max=b;//我又想起来茫茫雪原的猎人。
                 c=i;
             }

        }
        cout<<a[c]<<endl;
    }
    return 0;
}