HDU
来源:互联网 发布:华信软件学院 编辑:程序博客网 时间:2024/06/13 22:52
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1004点击打开链接
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 124355 Accepted Submission(s): 49067
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.
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.
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
5greenredblueredred3pinkorangepink0
Sample Output
redpink
Author
WU, Jiazhi
Source
ZJCPC2004
Recommend
JGShining
#include <iostream>#include <queue>#include <stdio.h>#include <stdlib.h>#include <stack>#include <limits>#include <string>#include <string.h>#include <vector>#include <set>#include <map>#include <algorithm>#include <math.h>using namespace std;map<string ,int > ::iterator it;int main(){ map<string ,int > mmap; int n=0; while(~scanf("%d",&n)&&n) { mmap.clear(); while(n--) { string s; cin >> s; mmap[s]++; } int sum=0; string ans; for(it=mmap.begin();it!=mmap.end();it++) { if((*it).second>sum) { sum=(*it).second; ans=(*it).first; } } cout << ans << endl; }}
阅读全文
0 0
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- hdu 4841 圆桌问题
- Java_观察者模式(Observable和Observer)
- 获取手机通讯录以及添加联系人
- dyld: lazy symbol binding failed: Symbol not found: _clock_gettime
- JAVAWEB开发之Solr的入门——Solr的简介以及简单配置和使用、solrJ的使用、Solr数据同步插件
- HDU
- spring boot整合redis(单机+集群)
- R中时间序列分析-趋势预测ARIMA
- SQL之case when then else end用法
- vuex学习七----Modules
- Spring Cloud与分布式系统
- ART深入浅出3--了解Boot.art和boot-*.art
- opencv: 颜色通道 探究(图示+源码)
- java8 Predicate接口API翻译