SDNU 1125 HDU 1004 Let the Balloon Rise【用map做水题】【map应用】 【8月14】
2015-08-14 19:09
411 查看
Let the Balloon Rise
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
Sample Output
输入n个气球颜色,输出颜色最多的气球的颜色。第一遍用结构体做的,想到还可以用map做,就用map做了,但还是出现了一些状况···map用的不熟练。map很强大!代码如下:
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
输入n个气球颜色,输出颜色最多的气球的颜色。第一遍用结构体做的,想到还可以用map做,就用map做了,但还是出现了一些状况···map用的不熟练。map很强大!代码如下:
#include<cstdio> #include<map> #include<iostream> #include<string> using namespace std; int main(){ int n; map<string,int>balloon; string maxcolor,color; while(scanf("%d",&n)==1&&n){ balloon.clear(); int maxn=0; for(int i=0;i<n;i++){ cin>>color; balloon[color]++; } map<string,int>::iterator it=balloon.begin(); for(;it!=balloon.end();it++) if(it->second>maxn){ maxn=it->second; maxcolor=it->first; } cout<<maxcolor<<endl; } return 0; }
相关文章推荐
- Android自定义控件之乱涂
- C# odbc
- 大头小头 字节序
- 华为OJ(矩阵乘法)
- Quartz源码分析(二)
- Python学习笔记23:Django构建一个简单的博客网站(一个)
- 九度oj 1030
- hdu 1171 Big Event in HDU 多重背包问题
- Android常用的一些make命令
- VC和gcc在保证功能static对线程安全的差异变量
- Ampzz 2011 Cross Spider 计算几何
- java:可变类StringBuffer与不可变类String
- VisualSVN5.0.1补丁原创发布
- 拓扑排序模板-优先队列 hdu 1285 确定比赛名次
- POJ 1181 大整数是否为素数以及求大整数的质因数-数论-(Miller_rabin+Pollard_rho)
- 最小生成树prim算法实现
- HDU 1232 畅通工程
- 九度 Online Judge 算法 刷题 题目1064:反序数
- ssh 使用密钥与登录进行远程cp
- poj 1458