zoukankan      html  css  js  c++  java
  • zoj 2104 Let the Balloon Rise

    ZOJ Problem Set - 2104
    Let the Balloon Rise

    Time Limit: 1 Second      Memory Limit: 32768 KB

    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: Zhejiang Provincial Programming Contest 2004
    Submit    Status
    //1289430 2009-04-19 20:46:43 Accepted 2104 0MS 252K 473 B C++ Wpl 
    #include <iostream>
    #include 
    <string>
    #include 
    <map>
    using namespace std;
    map
    <string,int>M;
    map
    <string,int>::iterator p,q;
    int n;
    int main()
    {
        
    string str;
        
    while(scanf("%d",&n)!=EOF&&n)
        {
            M.clear();
            
    while(n--)
            {
                cin
    >>str;
                
    if(M[str]==0)
                    M[str]
    =1;
                
    else
                    M[str]
    ++;
            }
            
    int m=-1;
            
    for(p=M.begin();p!=M.end();p++)
            {
                
    if((p->second)>m)
                {
                    m
    =p->second;
                    q
    =p;
                }
            }
            cout
    <<q->first<<endl;
        }
        
    return 0;
    }
  • 相关阅读:
    HDOJ2553 N皇后问题
    NYOJ284 坦克大战 BFS/优先队列
    NYOJ14 会场安排问题 贪心
    POJ1664 放苹果
    NYOJ119 士兵杀敌(三) RMQ
    POJ3264 Balanced Lineup RMQ/线段树
    POJ1127 Jack Straws
    HDOJ1128 Self Numbers
    水晶报表CrystalReports很强大也很简单!
    PetShop项目学习笔记(三)
  • 原文地址:https://www.cnblogs.com/forever4444/p/1452582.html
Copyright © 2011-2022 走看看