Let the Balloon Rise
Time Limit: 2000/1000 MS
(Java/Others)
Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s):
28182
Accepted Submission(s): 8964
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
#include<stdio.h>
#include<string.h>
int main()
{
int
n,i,j,max = 0,temp,tempmax;
char
color[1003][16];
while(1)
{
max=0;
temp=0;
scanf("%d",&n);
getchar();
if(n == 0)
return 0;
for(i = 0; i < n; i++)
{
gets(color[i]);
}
for(j = 0; j < n; j ++)
{
tempmax = 1;
for(i = j + 1; i < n; i ++)
{
if(strcmp(color[j],color[i]) == 0)
tempmax ++;
}
if(tempmax > max)
{
max = tempmax;
temp = j;
}
}
printf("%s\n",color[temp]);
}
return
0;
}