zoukankan      html  css  js  c++  java
  • HDU1004 BALLO0N

    Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 108214 Accepted Submission(s): 42023 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. 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. 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 5 green red blue red red 3 pink orange pink 0 Sample Output red pink Author WU, Jiazhi Source ZJCPC2004 Recommend JGShining | We have carefully selected several similar problems for you: 1008 1005 1003 1009 1019 #include #include #include using namespace std; int main() { int n, max; string s; map m; map::iterator it; while (cin >> n && n) { max = 0; m.clear(); for (int i = 0; i < n; i++) { cin >> s; m[s]++; } for (it = m.begin(); it != m.end(); it++) { max = max > it->second ? max : it->second; } for(it=m.begin();it!=m.end();it++) { if(max == it->second) { cout<first<
  • 相关阅读:
    01-发送你的第一个请求
    postman使用
    java poi导出多sheet页
    base64加密解密
    Django crontab
    super().__init__()
    paramiko模块
    列表转json数据返回
    socket模块判断ip加端口的连通性
    登录拦截器
  • 原文地址:https://www.cnblogs.com/lsh123/p/5887888.html
Copyright © 2011-2022 走看看