Let the Balloon Rise

Let the Balloon Rise

时间: 1ms        内存:64M

描述:

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 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.

输出:

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.

示例输入:

5
green
red
blue
red
red
3
pink
orange
pink
0

示例输出:

red
pink

提示:

参考答案(内存最优[752]):

#include<stdio.h>
#include<string.h>
int main()
{
	int n,i,j,k,b[1010],max;
	char a[1010][20];
	while(scanf("%d",&n)&&n)
	{
		getchar();
		for(i=0;i<1010;i++)
			for(j=0;j<20;j++)
			{
				a[i][j]=0;
				b[i]=0;
			}
		for(i=0;i<n;i++)
			scanf("%s",a[i]);
		for(i=0;i<n;i++)
			for(j=i+1;j<n;j++)
				if(strcmp(a[j],a[i])==0)
					b[i]++;
		max=-1;
		for(i=0;i<n;i++)
			if(b[i]>max)
			{
				max=b[i];
				k=i;
			}
		printf("%s\n",a[k]);
	}
	return 0;
}

参考答案(时间最优[0]):

#include<stdio.h>
#include<string.h>
int main()
{
	int n,i,j,k,b[1010],max;
	char a[1010][20];
	while(scanf("%d",&n)&&n)
	{
		getchar();
		for(i=0;i<1010;i++)
			for(j=0;j<20;j++)
			{
				a[i][j]=0;
				b[i]=0;
			}
		for(i=0;i<n;i++)
			scanf("%s",a[i]);
		for(i=0;i<n;i++)
			for(j=i+1;j<n;j++)
				if(strcmp(a[j],a[i])==0)
					b[i]++;
		max=-1;
		for(i=0;i<n;i++)
			if(b[i]>max)
			{
				max=b[i];
				k=i;
			}
		printf("%s\n",a[k]);
	}
	return 0;
}

题目和答案均来自于互联网,仅供参考,如有问题请联系管理员修改或删除。

点赞

发表评论

电子邮件地址不会被公开。必填项已用 * 标注