HDU1004——Let the Balloon Rise
来源:互联网 发布:炫彩表白软件 编辑:程序博客网 时间:2024/04/28 11:04
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<iostream>#include<string.h>#include<stdio.h>#include<ctype.h>#include<algorithm>#include<stack>#include<queue>#include<set>#include<math.h>#include<vector>#include<map>using namespace std;int main(){ int n; string color,s; map<string,int>Balloon; while(scanf("%d",&n)&&(n!=0)) { Balloon.clear(); for(int i=0;i<n;i++) { cin>>color; Balloon[color]++; } int max=-1; map<string,int>::iterator p; for(p=Balloon.begin();p!=Balloon.end();p++) { if((*p).second>max) { max=(*p).second; s=(*p).first; } } cout<<s<<endl; } return 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
- 构建和实现单点登录解决方案
- Linq to sql:
- SilverLight概述
- [leetcode] Sqrt(x)
- 关于 windows 互斥锁CRITICAL_SECTION 多次加锁,需要多少释放的问题
- HDU1004——Let the Balloon Rise
- Asterisk 未来之路3.0_0006
- 如何使用飞秋FeiQ实现两电脑通信(或传输文件)
- Linq to sql:使用存储过程新增数据
- OnClose()和OnDestroy()
- 手机科普贴 告诉你RAM和ROM的真正区别
- poj 2631(dfs求最长路径)
- SQL Server 中 触发器用法
- HDUOJ题目分类