HDOJ-1004 Let the Balloon Rise

最新推荐文章于 2024-07-25 23:22:43 发布

ahardstone

最新推荐文章于 2024-07-25 23:22:43 发布

阅读量90

点赞数

分类专栏：练习题文章标签： c++ 蓝桥杯算法

本文链接：https://blog.csdn.net/gfyy_bkj/article/details/127173330

版权

练习题专栏收录该内容

42 篇文章 1 订阅

订阅专栏

Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 198678 Accepted Submission(s): 79909

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

#include <bits/stdc++.h>
using namespace std;
char mp[1005][20];//构建二维数组
int countt[1005]; //count好像和什么名字冲突了 
int main()
{
	int n;
	while (scanf("%d", &n), n != 0)
	{
		for (int i = 0; i < n; i++)
		{
			scanf("%s", &mp[i]);//读取字符串 
		}
		for (int i = 0; i < n; i++)
		{
			countt[i] = 1;//顺便更新一下计数数组 
			for (int j = 0; j < i; j++)
			{
				if (strcmp(mp[i], mp[j]) == 0)
				{
					countt[j]++;
					break;//把数目寄存到第一次出现这种颜色的位置，然后break减小复杂度，不过没有也可以过 
				}
			}
		}
		int max, pos;
		max = 0;
		for (int i = 0; i < n; i++)
		{
			if (max < countt[i])
			{
				max = countt[i];
				pos = i;//记录最大处的下标 
			}
		}
		printf("%s\n", mp[pos]);
	}
	return 0;
}