Let the Balloon Rise

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 127135    Accepted Submission(s): 50242

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

5greenredblueredred3pinkorangepink0

 

Sample Output

redpink
中文描述：
让气球上升
时间限制：2000/1000 MS（Java / Others）内存限制：65536/32768 K（Java / Others）总提交：127135接受提交：50242

问题描述
再次参加比赛 看到气球漂浮多么兴奋。但是要告诉你一个秘密，法官最喜欢的时间是猜测最受欢迎的问题。比赛结束后，他们会对每种颜色的气球进行计数，并找出结果。今年他们决定把这个可爱的工作交给你。
 

输入
输入包含多个测试用例。每个测试用例以数字N（0 <N <= 1000）开始 - 分发的气球总数。接下来的N行每行包含一个颜色。气球的颜色是多达15个小写字母的字符串。N = 0的测试用例终止输入，不会处理此测试用例。
 

产量
对于每种情况，在单行上打印最流行的问题的气球颜色。确保每个测试用例都有独特的解决方案。
 

样品输入
5 绿色红色蓝色红色红色红色3 粉红色橙色粉色0
 

样品输出
红色粉红色
代码：
#include <stdio.h>#include <string.h>int main(){int flag;int max;int n,i,j;char s[1001][20];int a[1001];while(scanf("%d",&n)!=EOF&&n!=0){for(i=0;i<n;i++){scanf("%s",s[i]);}flag=0;max=0;for(i=0;i<n-1;i++){a[i]=1;for(j=i+1;j<=n;j++){if(strcmp(s[i],s[j])==0){a[i]+=1;}}if(max<a[i]){max=a[i];flag=i;}}printf("%s\n",s[flag]);}return 0;}