加载中…
个人资料
谢先斌
谢先斌
  • 博客等级:
  • 博客积分:0
  • 博客访问:391,694
  • 关注人气:201
  • 获赠金笔:0支
  • 赠出金笔:0支
  • 荣誉徽章:
相关博文
推荐博文
谁看过这篇博文
加载中…
正文 字体大小:

1004 Let the Balloon Rise

(2012-09-20 22:01:46)
标签:

c

hdu1004

谢先斌

教育

分类: ACM/C语言解答

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

 

 

Source

ZJCPC2004

 

 

Recommend

JGShining

 

 

6806578

2012-09-20 20:55:54

Accepted

1004

15MS

308K

634 B

C++

hixxb

 

 

#include

using namespace std;

 

int main()

{

       int i, j, num[1002], n, k, max, t;

       char ball[17], balloons[1002][17];

       while(cin>>n)

       {

              if(n==0)

                     break;

              k=0;

              memset(num, 0, sizeof(num));

              for(i=0; i

              {

                     cin>>ball;

                     for(j=0; j

                            if(strcmp(ball, balloons[j])==0)

                            {

                                   num[j]++;

                                   break;

                            }

                     if(j==k)

                     {

                            num[k]=1;

                            strcpy(balloons[k], ball);

                            //cout<<balloons[k]<<endl;

                            k++;

                     }

              }

              max=0;

              t=0;

              for(j=0; j

              {

                     if(num[j]>max)

                     {

                            max=num[j];

                            t=j;

                     }

              }

              cout<<balloons[t]<<endl;

       }

       return 0;

}

0

阅读 评论 收藏 转载 喜欢 打印举报/Report
前一篇:1003 Max Sum
  • 评论加载中,请稍候...
发评论

    发评论

    以上网友发言只代表其个人观点,不代表新浪网的观点或立场。

    < 前一篇1003 Max Sum
      

    新浪BLOG意见反馈留言板 电话:4000520066 提示音后按1键(按当地市话标准计费) 欢迎批评指正

    新浪简介 | About Sina | 广告服务 | 联系我们 | 招聘信息 | 网站律师 | SINA English | 会员注册 | 产品答疑

    新浪公司 版权所有