zoukankan      html  css  js  c++  java
  • CDZSC_2015寒假新人(1)——基础 A

    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
     
     
    思路:利用结构题来做,存这个单词和他出现的次数
     
    View Code
  • 相关阅读:
    2019春总结作业
    第十二周作业及总结
    第十一周作业及总结
    第十周编程及总结
    第九周作业及总结
    第八周作业及总结
    第五周作业及总结
    第四周Java作业及总结
    第三周总结
    第二周总结
  • 原文地址:https://www.cnblogs.com/Wing0624/p/4243793.html
Copyright © 2011-2022 走看看