Let the Balloon Rise

Let the Balloon Rise

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

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
  
  
  
  


  
  
  
  

   
   思路 ：  每获取一个字符串，就要和之前的所有字符串比较看是否相同，如果相同加一，只保留不同的字符串；
  
  
  
  

   
   代码
  
  
  
  

   
   #include<stdio.h>
#include<string.h>
#include<algorithm>
#define M 1000+10
typedef struct 
{

   
   	char ss[20];   // 记录字符串（不同的）

   
   	int num;    //  记录这个字符串的个数
}bol;
bol a[M];
int cmp(bol a,bol b)   // 快排后 最大个数的字符串就是第一个了
{

   
   	return a.num>b.num;
}
using namespace std;
int main()
{

   
   	int n;

   
   	while (scanf("%d",&n)&&n) 

   
   	{

   
   		getchar();

   
   		scanf("%s",a[0].ss);  

   
   		a[0].num=1;

   
   		int i=1；  //  记录第i个不同的字符串

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

   
   		{

   
   			char str[20];

   
   			scanf("%s",str);int k;

   
   			for(k=0;k<i;k++)

   
   			{

   
   				if(!strcmp(str,a[k].ss))  // 如果相同 则个数+1

   
   				{

   
   					a[k].num++;

   
   					break;

   
   				}

   
   			}

   
   			if(k>=i)   //  如果循环一遍还没有相同的  自己就为 新元素，个数为1

   
   			{

   
   				strcpy(a[i].ss,str);

   
   				a[i++].num=1;

   
   			}

   
   		}

   
   		sort(a,a+i-1,cmp);

   
   		puts(a[0].ss);

   
   	}

   
   	

   
   	return 0;

   
   	
 }