zoukankan      html  css  js  c++  java
  • ZOJ Problem Set–2104 Let the Balloon Rise

    Time Limit: 2 Seconds      Memory Limit: 65536 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

      1: #include<iostream>
    
      2: #include<map>
    
      3: #include<string>
    
      4: using namespace std;
    
      5: 
    
      6: int main()
    
      7: {
    
      8:   int n;
    
      9:   while(cin>>n && n)
    
     10:   {
    
     11:     string ballon, crtBallon;
    
     12:     int count = 0;
    
     13:     map<string,int> ma;
    
     14:     while(n-- && cin>>crtBallon)
    
     15:     {
    
     16:       if(ma.find(crtBallon) != ma.end())
    
     17:         ma[crtBallon] = ma[crtBallon] + 1;
    
     18:       else
    
     19:         ma[crtBallon] = 1;
    
     20:       if(ma[crtBallon] > count)
    
     21:       {
    
     22:         ballon = crtBallon;
    
     23:         count = ma[crtBallon];
    
     24:       }
    
     25:     }
    
     26:     cout<<ballon<<endl;
    
     27:   }
    
     28: }
  • 相关阅读:
    mysql之优化器、执行计划、简单优化
    一条查询sql的执行流程和底层原理
    mysql建立索引,实际工作中建立索引的示例
    explain命令---查看mysql执行计划
    mysql 一些知识点
    开发中一些快捷键的使用
    simple-rpc
    maven
    数组合并排序
    SpringMVC配制全局的日期格式
  • 原文地址:https://www.cnblogs.com/malloc/p/2505730.html
Copyright © 2011-2022 走看看