HDU 1004
来源:互联网 发布:eclipse java窗体程序 编辑:程序博客网 时间:2024/05/02 02:00
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.
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
题意:求出现次数最多的颜色,直接可以想到map容器。
#include<bits/stdc++.h>using namespace std;int main(){ int t,i; map<string,int>m,j; string ch; while(cin>>t&&t) { m.clear(); while(t--) { cin>>ch; m[ch]++; } map<string,int>::iterator it; int maxm=0; string maxn; for(it=m.begin(); it!=m.end(); it++) { if(maxm<it->second) { maxm=it->second; maxn=it->first; } } cout<<maxn<<endl; } return 0;}
0 0
- HDU 1004
- Hdu 1004
- HDU 1004
- hdu 1004
- hdu 1004
- hdu 1004
- HDU-1004
- hdu 1004
- HDU 1004
- HDU 1004
- hdu 1004
- HDU 1004
- hdu 1004
- HDU 1004
- hdu--1004
- HDU 1004
- HDU 1004
- hdu-1004
- 一个页面,两个分页,JS写法
- Linux内核--网络栈实现分析(一)--网络栈初始化
- Swift3.0创建简单的TableView
- Python爬虫实例1-抓取百度贴吧
- java接口的继承问题
- HDU 1004
- DP-POJ 1163 Triangle(简单数字三角形)
- javascript学习笔记
- java默认的无参构造方法中应该注意的问题。
- 【codevs】基础题合集(三)
- 将文件内容先替换后复制
- Service 开机接受广播,启动服务的问题
- rabbitmq组件断链重连机制
- 链表的介绍及双向链表的实现c/c++/java