杭电1004

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
  
  
  
  

   
   题目意思：输出出现次数最多的字符串。
  
  
  
  

   
   我的代码：
  
  
  
  

   
   #include<stdio.h>
#include<string.h>
char a[1000][16];
int b[1000];
int main(){

   
   	int i,j,m,n,max;

   
   	while(scanf("%d",&n)!=EOF){

   
   		getchar();

   
   		if(n==0)

   
   		 break;

   
   		for(i=1;i<=n;i++){

   
   			b[i]=0;

   
   			gets(a[i]);//读取字符串 ，

   
   		}

   
   	for(i=1;i<=n;i++){

   
   		for(j=1;j<=n;j++)

   
   		  if(strcmp(a[i],a[j])==0)//字符比较函数，strcmp(s1,s2),s1,s2可以是字符数组名或字符常量

   
   		     b[i]++;//每个字符在所有字符中出现的次数，存放在b[i]中 

   
   	}

   
   	//找出出现次数最多的字符串并输出

   
   	m=1;max=b[1];

   
   	for(i=2;i<=n;i++)

   
   		if(max<b[i]){

   
   		  m=i;

   
   		  max=b[i];

   
   	    }

   
   	printf("%s\n",a[m]);
}
}

  
  
  
  

   
   运行结果：