hdu 1004 Let the Balloon Rise

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

转载最新推荐文章于 2021-06-24 22:53:24 发布 · 45 阅读

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/GadyPu/p/4539958.html

本文介绍如何利用STL（标准模板库）解决HDOJ比赛中的一个问题，即在给定的气球数量和颜色分布下，找出最流行的气球颜色。通过读取输入数据，统计每种颜色的气球数量，并使用STL中的map数据结构高效地实现这一任务。最后，输出最流行颜色的气球。

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

题目连接

http://acm.hdu.edu.cn/showproblem.php?pid=1004

Let the Balloon Rise

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

字符串简单题stl水过。。

 1 #include<algorithm>
 2 #include<iostream>
 3 #include<cstdlib>
 4 #include<cstring>
 5 #include<cstdio>
 6 #include<string>
 7 #include<map>
 8 using std::map;
 9 using std::string;
10 map<string, int> rec;
11 int main() {
12 #ifdef LOCAL
13     freopen("in.txt", "r", stdin);
14     freopen("out.txt", "w+", stdout);
15 #endif
16     int n;
17     char buf[20];
18     while (~scanf("%d", &n) && n) {
19         int tot = 0;
20         for (int i = 0; i < n; i++) scanf("%s", buf), rec[buf]++;
21         map<string, int>::iterator ite;
22         for (ite = rec.begin(); ite != rec.end(); ++ite) {
23             if (ite->second > tot) {
24                 tot = ite->second;
25                 strcpy(buf, ite->first.c_str());
26             }
27         }
28         printf("%s\n", buf);
29         rec.clear();
30     }
31     return 0;
32 }