Let the Balloon Rise

最新推荐文章于 2022-07-15 08:45:00 发布

runnerzyc

最新推荐文章于 2022-07-15 08:45:00 发布

阅读量216

点赞数

CC 4.0 BY-SA版权

分类专栏： oj入门 acm水题

本文链接：https://blog.youkuaiyun.com/fastkeeper/article/details/39189565

oj入门同时被 2 个专栏收录

39 篇文章

订阅专栏

acm水题

36 篇文章

订阅专栏

本文介绍了一个简单的编程问题，即从一组颜色字符串中找出出现频率最高的颜色。通过使用C语言实现，文章提供了一种基本的解决方案，该方案通过双重循环来比较每个字符串并计算其出现次数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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
题意：此题是给定一组字符串，求出现次数最多的字符串；
分析：此题可用二维数组控制啊a[i][j]；i表示第几个，j表示字符串中的字符数；
可以用两个for循环控制，让其中一个字符串依次与后面的比较；
代码;
#include<stdio.h>
#include<string.h>
int main()
{
	int n,max,i,j,t,d;
	char a[1020][20];
	while(~scanf("%d",&n),n!=0)
	{
		for(i=0;i<n;i++)
		scanf("%s",a[i]);
		max=0;
		for(i=0;i<n;i++)
	 {  d=0;
		for(j=i;j<=n;j++)
		if(strcmp(a[i],a[j])==0)
		d++;
		if(max<d)
		{
		 max=d;t=i;
	    }
     } 
     printf("%s\n",a[t]);
	}
	return 0;
}