hdu1004 Let the Balloon Rise
来源:互联网 发布:netstat windows 编辑:程序博客网 时间:2024/06/15 04:06
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 124843 Accepted Submission(s): 49281
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
#include<string>#include<iostream>#include<map>#include<vector>using namespace std;int main(){int n;string s, t;while(scanf("%d", &n) && n){map<string,int> cnt; // 定义Map容器,定义在while循环里面 for(int i = 0; i < n; i++){cin >> s;if(!cnt.count(s)){cnt[s] = 1;}else{cnt[s]++;}}int max = 0;map<string, int>::iterator it; //迭代器 for(it = cnt.begin(); it != cnt.end(); it++){if(it->second > max){max = it->second;t = it->first;}}cout<<t<<endl;}return 0;}
阅读全文
0 0
- HDU1004 Let the Balloon Rise
- HDU1004--Let the Balloon Rise
- HDU1004 Let the Balloon Rise
- HDU1004:Let the Balloon Rise
- hdu1004 Let the Balloon Rise
- hdu1004 Let the Balloon Rise
- hdu1004 Let the Balloon Rise
- hdu1004 Let the Balloon Rise
- hdu1004 - Let the Balloon Rise
- Hdu1004 Let the Balloon Rise
- HDU1004 Let the Balloon Rise
- hdu1004 Let the Balloon Rise
- HDU1004 Let the Balloon Rise
- hdu1004 -Let the Balloon Rise
- hdu1004 Let the Balloon Rise
- (hdu1004)Let the Balloon Rise
- hdu1004——Let the Balloon Rise
- HDU1004——Let the Balloon Rise
- ACM与Java
- 转 基于贪心算法求解TSP问题(JAVA)
- Excel地址转换
- RTL设计基础(一)
- 蓝桥杯试题 网络寻路 (构图+深搜)
- hdu1004 Let the Balloon Rise
- 6.括号问题
- Java中Vector与ArrayList的区别详解
- 100. Same Tree
- Python科学计算——高低通滤波器的设计与使用
- 浅谈java.util.Vector类的add()和addAll()方法
- Java中Arrays的asList()方法
- 8.第一个数字(数字的值返回)
- 9.放麦子