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
杭电ACM----------1004 Let the Balloon Rise
最新推荐文章于 2019-04-06 13:08:04 发布
该博客介绍了如何利用C++和STL中的map来解决杭电ACM比赛中的1004题,即计算不同字符串出现的最大次数,通过map统计每个字符串出现的频率,然后找出最大值。
摘要由CSDN通过智能技术生成