hdu-oj 1004 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): 73550    Accepted Submission(s): 27471

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

题目大意：输出出现次数最多的颜色单词；

解题思路：定义字符串数组，然后利用冒泡排序，和strcmp比较函数用数组，存储相同单词数目出现的次数，最后比较次数大小输出次数最大对应的字符串。

附代码：

#include <stdio.h>#include <string.h>int main(){ int n,m,i,j,a[10010],max;   char s[10010][16];   while(scanf("%d",&n),n)   { for(i=1;i<=n;i++)            scanf("%s",s[i]);      max=0;     for(i=1;i<=n;i++)      { for(j=i+1,a[i]=0;j<=n;j++)       {  if(strcmp(s[i],s[j])==0)            a[i]++;       }       if(max<a[i])        max=a[i];      }      for(i=1;i<=n;i++)            if(a[i]==max)                puts(s[i]);        }   return 0;}