HDU1004 查气球

Let the Balloon Rise

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

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:  1008 1019 1021 1013 1012

#include <string.h>
#include <iostream>
#include <algorithm>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
int main()
{
    int i,j,n,t;
    while (cin>>n&&n)
    {
        char c[][];
        int a[];
        memset(a,,sizeof(a));
        for (i=;i<n;i++)
        {
            cin>>c[i];
            for (j=;j<i;j++)
            {
                if (strcmp(c[i],c[j])==)
                a[i]++;
            }
        }
        int max=,t=;
        for (i=;i<n;i++)
        {
            if (a[i]>max)
            {
                max=a[i];
                t=i;
            }
        }
        cout<<c[t]<<endl;

    }

    return ;
}