hdu-1004-Let the Balloon Rise
来源:互联网 发布:指纹考勤机软件 编辑:程序博客网 时间:2024/06/06 20:37
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 57546 Accepted Submission(s): 21032
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
代码:
import java.util.HashMap;
import java.util.Scanner;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
HashMap<String,Integer> hashmap=new HashMap<String,Integer>();
Scanner input=new Scanner(System.in);
while(true){
int n=input.nextInt();
if(n==0)
break;
else{
String b="";
int c=0;
for(int i=1;i<=n;i++){
String a=input.next();
int e=1;
if(hashmap.get(a)!=null){
e=hashmap.get(a)+1;
hashmap.put(a, e);
}
else
hashmap.put(a, e);
if(c<e){
c=e;
b=a;
}
}
System.out.println(b);
}//else
}
}
}
- HDU 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- HDU--1004 Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- Hdu 1004 - Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- HDU--1004--Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise STL
- 无向图 双连通分量的模板
- 锁定表操作
- 企业类网站如何在百度首页生存?
- 从逆向分析角度看C++虚函数
- 非深入探寻Java反射机制 (Constructor)
- hdu-1004-Let the Balloon Rise
- SQL 查找重复记录
- 正多边形
- 如何分析挖掘竞争对手的方针方法与策略
- HDU-2600
- 有向图 强连通分量
- 二叉树的创建与各种遍历详解
- CentOS 6.3下Samba服务器的安装与配置
- 获取iframe中的网页内容(同域名下)