1006Let the Balloon Rise （ 让气球上升）

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>
void re(int m[])//由于不知道简单做法，所以。。。。
{
	int i;
	for(i=0;i<1000;i++)
			m[i]=0;
}
int main()
{
	int n,i,j,max[1000],m,k;
	char a[1000][20];
	while(scanf("%d",&n)!=EOF&&n!=0)
	{
		getchar();//解决gets得到不需要的值问题
		re(max);//清零
		k=n;
		while(k--)
		{
			gets(a[k]);
		}
		for(i=0;i<n;i++)//气球上升，就是冒泡排序啦（差不多）
			for(j=i+1;j<n;j++)
			{
				if(strcmp(a[i],a[j])==0)//没排，把出现的次数记下来
				{
					max[i]++;//用一维数组记录下标表示行数记录这一行的数据出现了几次（不过是从0开始的，不影响）
				}
				
			}
			m=0;//清零
			for(i=0;i<100;i++)//找到最大出现次数对应的下标
			{
				if(max[m]<max[i])
					m=i;
			}
			printf("%s\n",a[m]);//下标就是第几个颜色输出便可
	}
return 0;
}

自己做的，仿冒必究。

嘿嘿。。

0.0