HDU1004 Let the Balloon Rise 数据结构
2016-01-31 19:20
435 查看
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 98751 Accepted Submission(s): 37811
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
#include <vector> #include <list> #include <map> #include <set> #include <deque> #include <queue> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <complex> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cstring> #include <ctime> #include <cassert> using namespace std; #define LL long long //#define DEBUG int main() { #ifdef DEBUG freopen("E:\\data.in", "r", stdin); #endif // DEBUG int n; char now[20], maxball[20]; while (scanf("%d", &n) != EOF) { map<string, int>ball; if (!n)break; for (int i = 0; i < n; i++) { scanf("%s", now); ball[now]++; } map<string, int>::iterator max = ball.begin(); for (map<string, int>::iterator it = ball.begin(); it != ball.end(); it++) if (it->second > max->second) max = it; cout << max->first << endl; } return 0; }
相关文章推荐
- Lua数据结构 — 闭包(四)
- Lua数据结构 — TString(二)
- Lua数据结构 — TValue(一)
- Lua数据结构 — Table(三)
- Nginx源码分析 - 基础数据结构篇 - 链表结构 ngx_queue.c
- 数据结构基础之线性表
- 数据结构实践——“求两集合交集”的一个错解分析
- 数据结构之栈
- 数据结构实践——顺序表应用
- 数据结构和算法学习
- 数据结构:JavaScript实现链表
- 数据结构--B 树、B+ 树、B* 树
- 数据结构-二叉树
- 数据结构--树及相关特性
- 排序算法
- 小蚂蚁学习数据结构(27)——题目——一个关于链表的题目
- 数据结构和算法
- 各种排序算法整理
- 数据结构实验之排序四:寻找大富翁(堆排序)
- 4-5-创建索引表-串-第4章-《数据结构》课本源码-严蔚敏吴伟民版