hdu 1004 Let the Balloon Rise

Let the Balloon Rise

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

 

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   |   We have carefully selected several similar problems for you:  1006 1071 1007 1022 1032 

 

 

水题，运用字符串函数可以很轻松地解决问题，使用了标记的思想。

题意：第一个数字代表气球个数，后面的字符串表示气球的颜色，输出颜色出现次数最多的颜色，结果保证只有一种。

附上代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
    char str[1005][20];
    int n,m,i,j,s[1005],t;
    while(~scanf("%d",&n)&&n)
    {
        for(i=0; i<n; i++)
            scanf("%s",str[i]);  //输入字符串，用str数组存起来
        memset(s,0,sizeof(s));
        int max=0;          //记录最后出现最大的次数
        for(i=0; i<n; i++)
        {
            for(j=i+1; j<n; j++)
                if(strcmp(str[i],str[j])==0)  //strcmp函数比较两个字符串是否相同
                    s[i]++;   //标记每种颜色出现的次数
            if(s[i]>max)
            {
                max=s[i];
                t=i;         //记录出现最大次数的颜色位置
            }
        }
        printf("%s
",str[t]);
    }
}