HDU/HDOJ 1004 Let the Balloon Rise（颜色统计）

最新推荐文章于 2021-06-24 22:53:24 发布

Shyazhut

最新推荐文章于 2021-06-24 22:53:24 发布

阅读量446

点赞数

CC 4.0 BY-SA版权

分类专栏：一块水过这的题 HDU

本文链接：https://blog.youkuaiyun.com/shyazhut/article/details/52194032

一块水过这的题同时被 2 个专栏收录

144 篇文章

订阅专栏

HDU

111 篇文章

订阅专栏

本题是一道简单的统计题目，需要统计出现次数最多的气球颜色。输入包括多组测试数据，每组数据首先给出气球总数，随后列出各气球的颜色。通过排序和遍历的方法找出最频繁出现的颜色。

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

New~ 欢迎参加2016多校联合训练的同学们~

Let the Balloon Rise

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 107654 Accepted Submission(s): 41780

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

Author

WU, Jiazhi

Source

ZJCPC2004

题意：

很明确的题意，就是统计出出现最多的颜色。

思路：

没学习结构体排序之前还真不知道怎么做，

不知道把颜色首字母转换为数字用一位数组对不对（毕竟存在BUG不知道颜色都是哪些）。

Code：

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#define MYDD 1103

using namespace std;

struct Q {
	char color[16];
} balloons[MYDD];

bool cmp_color(Q x,Q y) {//对气球颜色进行排序
	return strcmp(x.color,y.color)>0? 1:0;
}

int MAX(int x,int y) {
	return x<y? x:y;//
}

int main() {
	int n;
	char dd[16];//答案颜色
	while(scanf("%d",&n)&&n) {
		for(int j=0; j<n; j++)
			scanf("%s",balloons[j].color);

		sort(balloons,balloons+n,cmp_color);

		char now[16];//记录当前待比较的颜色
		int max=0;//记录最多气球颜色的个数
		int ans=0;//记录当前气球颜色的个数
		strcpy(now,balloons[0].color);
		strcpy(dd,balloons[0].color);
		for(int j=0; j<n; j++) {
			if(strcmp(now,balloons[j].color)==0)
				ans++;
			else {//颜色不同
				if(ans>max) {
					strcpy(dd,balloons[j-1].color);//ans 记录的是前一个气球颜色的个数
					max=ans;
				}
				strcpy(now,balloons[j].color);//极记为当前气球颜色
				ans=1;
			}
		}
		puts(dd);
	}
	return 0;
}
/*
7
C A B A B C C
3
a B C
*/