HDU 1004 Let the Balloon Rise(map)
来源:互联网 发布:正交矩阵和实对称矩阵 编辑:程序博客网 时间:2024/06/10 10:14
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.
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.
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.
5
green
red
blue
red
red
3
pink
orange
pink
0
Sample Output
red
pink
题意就是统计啥颜色气球最多输出那个颜色。
STL-map学习地址:http://blog.csdn.net/hoaresky1998/article/details/50626246
代码如下:
博客已搬:洪学林博客
0 0
- HDU 1004 Let the Balloon Rise【Map】
- hdu 1004 Let the Balloon Rise map
- HDU 1004 Let the Balloon Rise(map)
- HDU 1004 Let the Balloon Rise map
- hdu 1004 Let the Balloon Rise map的应用
- 【map热手题】HDU 1004—Let the Balloon Rise
- HDU 1004 Let the Balloon Rise Map的应用
- HDU-1004 Let the Balloon Rise(STL: map)
- HDU 1004 Let the Balloon Rise(Map)
- Hdu 1004 Let the Balloon Rise map解决方法
- HDU-#1004 Let the Balloon Rise(字符串+map)
- map容器的应用:hdu 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise(STL之map)
- HDU 1004 Let the Balloon Rise (map使用)
- 【hdu 1004】Let the Balloon Rise(map)
- HDU 1004 Let the Balloon Rise (map使用)
- HDU 1004 Let the Balloon Rise(map)
- Hdu oj 1004 Let the Balloon Rise(map)
- 浏览器cannot read property 'msie' of undefined的解决方法
- [LeetCode]159. Longest Substring with At Most Two Distinct Characters
- 图解正向代理、反向代理、透明代理
- 蓝桥杯 历届试题 蚂蚁感冒 (模拟)
- [LeetCode]160. Intersection of Two Linked Lists
- HDU 1004 Let the Balloon Rise(map)
- 短作业优先与时间片轮转法
- 一次失败的j2v8集成
- Tuple and Tie
- cmd运行Java程序的问题
- LeetCode78. Subsets
- 学习笔记-----listview中含有togglebutton
- 最简单的基于FFMPEG的转码程序
- jQuery源码分析:如何解决jQuery、$关键字与其它脚本框架的冲突问题?