hdu1004Let the Balloon Rise

最新推荐文章于 2024-06-24 17:07:58 发布

原创最新推荐文章于 2024-06-24 17:07:58 发布 · 381 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

出现多少次

本文介绍了一道编程题，任务是找出比赛中最流行的气球颜色。输入包括多个测试案例，每个案例首先给出气球总数，随后列出每只气球的颜色。文章提供了C语言的解决方案，通过计数每种颜色出现的次数来确定最受欢迎的颜色。

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

题目大意：输出出现次数最多的颜色，N为0是结束标志

源代码：

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