1004 Let the Balloon Rise

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

 

Author

WU, Jiazhi

 

Source

ZJCPC2004

 

水题，只要将出现过的颜色一一存下，从后向前两两进行比较，并进行计数。相同就++。

则最后count最大的颜色就是最popular的颜色。

#include<iostream>#include<string>using namespace std;int main(){int N,i,j,count,max,color;char a[1001][16];while(cin>>N&&N!=0){getchar();max=1;for(i=0;i<N;i++){gets(a[i]);}for(i=0;i<N;i++){count=1;if(a[i][0]=='\0')continue;for(j=i+1;j<N;j++){if(a[j][0]=='\0')continue;if(strcmp(a[i],a[j])==0){count++;a[j][0]='\0';}}if(count>max){max=count;color=i;}}puts(a[color]);}}