1004 Let the Balloon Rise

发布时间: 更新时间: 总字数:243 阅读时间:1m 作者: IP属地: 分享 复制网址
专栏文章

    1004 Let the Balloon Rise

    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 cas 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
    using namespace std;
    
    int main()
    {
           int i, j, num[1002], n, k, max, t;
           char ball[17], balloons[1002][17];
           while(cin>>n)
           {
                  if(n==0)
                         break;
                  k=0;
                  memset(num, 0, sizeof(num));
                  for(i=0; i
                  {
                         cin>>ball;
                         for(j=0; j
                                if(strcmp(ball, balloons[j])==0)
                                {
                                       num[j]++;
                                       break;
                                }
                         if(j==k)
                         {
                                num[k]=1;
                                strcpy(balloons[k], ball);
                                //cout<<balloons[k]<<endl;
                                k++;
                         }
                  }
    
                  max=0;
                  t=0;
                  for(j=0; j
                  {
                         if(num[j]>max)
                         {
                                max=num[j];
                                t=j;
                         }
                  }
                  cout<<balloons[t]<<endl;
           }
    
           return 0;
    }
    
    Home Archives Categories Tags Statistics
    本文总阅读量 次 本站总访问量 次 本站总访客数