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
1 5 2green 3red 4blue 5red 6red 73 8pink 9orange 10pink 110 12 13 14 15 16
Sample Output
1 red 2pink 3 4 5 6 7
代码：
1#include <iostream> 2#include<stdio.h> 3#include<stdlib.h> 4#include<string.h> 5using namespace std; 6 7int main() 8{ 9 int n,i,j,s=1,b[1010],f[1010]; 10 char a[1010][20]; 11 while(~scanf("%d",&n)&&n) 12 { 13 memset(b,0,sizeof(b)); 14 for(i=0; i<n; i++) 15 { 16 scanf("%s",a[i]); 17 } 18 for(i=0; i<n; i++) 19 { 20 f[i]=1; 21 for(j=i+1; j<n; j++) 22 { 23 if(b[j]==0) 24 { 25 26 if(strcmp(a[i],a[j])==0)//这里我不知道为什么用a[i]==a[j]就不可以，求大神评论解释一下，谢谢了 27 { 28 b[j]=1; 29 f[i]=f[i]+1; 30 } 31 } 32 } 33 } 34 int s=0; 35 for(i=0; i<n; i++) 36 { 37 if(f[s]<=f[i]) 38 { 39 s=i; 40 } 41 } 42 printf("%s\n",a[s]); 43 } 44 return 0; 45}
本文同步分享在 博客“谙忆”（CSDN）。
如有侵权，请联系 support@oschina.cn 删除。
本文参与“OSC源创计划”，欢迎正在阅读的你也加入，一起分享。