hdu 1004 很水的一道题

Let the Balloon Rise

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

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
  
  

这道题的题意就是输出最多出现的字符串！ 

z这道题按照常规的方法来写就行了 没有什么特殊的要求 但是在写的时候要判断等于1的时候这个坑 我用的办法跟别人的标记数组不一样所以会出现测试数据为1的时候的小坑。

代码如下：

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

#define N 100005
int main()
{
    char mapp[1005][20], s[20], maxs[18];
    int n, i, j, k, sum[1005], flag,maxx;///flag为标记是否出现重复的字符串
    while(scanf("%d",&n),n)
    {
        k=0;maxx=-1;
        getchar();
        memset(sum,0,sizeof(sum));
        for(i=0;i<n;i++)
        {
            memset(s,0,sizeof(s));
            gets(s);
            flag=0;
            j=0;
            for(j=0;j<k;j++)
            {
                if(strcmp(s,mapp[j])==0)
                {
                    sum[j]++;

                    flag=1;
                }
                if(maxx<sum[j])
                {
                    maxx=sum[j];
                    strcpy(maxs,mapp[j]);

                }
                if(flag)
                    break;
            }
            if(flag==0)
            {
                strcpy(mapp[j],s);
                k++;
                sum[j]++;
            }
            if(maxx<sum[j])
            {
                maxx=sum[j];
                strcpy(maxs,mapp[j]);

            }
        }
        printf("%s\n",maxs);
    }
    return 0;
}