Let the Balloon Rise
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
HDU1004
分析:用a[1000][16]来存储颜色信息,用count[1000]来统计每个颜色出现的次数
先输入一个颜色,从第二个颜色的输入开始,每输入一个,都要和之前输入的所有颜色进行比较,若是一样,则在数组对应位置上+1, 然后在count[1000]中查找最大数,输出其下标,找到对应的颜色输出
#include<stdio.h>
#include<string.h>
int main()
{
char a[1010][16];
int i,j,n;
int mid[1010];
int max,m;
while(~scanf("%d",&n))
{
if(n)
{
mid[0]=0;
scanf("%s",a[0]);
for( i=1; i<n; i++)
{
mid[i]=0;
scanf("%s",a[i]);
for( j=0; j<i-1; j++)
{
if(strcmp(a[i],a[j])==0)mid[i]++;
}
}
max=0;
m=0;
for( i=1; i<n; i++)
{
if(mid[i]>max)
{
max=mid[i];
m=i;
}
}
printf("%s\n",a[m]);
}
}
return 0;
}