HDU 1004 Let the Balloon Rise

最新推荐文章于 2021-06-24 22:53:24 发布

原创最新推荐文章于 2021-06-24 22:53:24 发布 · 297 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#each #input #ini #string #up

hdu ACM 水题128题专栏收录该内容

61 篇文章

订阅专栏

本文介绍了一个简单的编程问题——统计比赛中发放的各种颜色气球的数量，并找出最受欢迎的问题对应的气球颜色。通过使用C语言实现，该文提供了完整的源代码，旨在帮助读者理解如何进行字符串比较和计数。

Let the Balloon Rise

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

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

Author

WU, Jiazhi

Source

ZJCPC2004

Recommend

JGShining

分析：简单的统计那个字符串出现次数最多

代码：

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

int main()
{
int N;
char str[1100][20];
int a[1100];
while(scanf("%d",&N))
{
getchar();
memset(a,0,sizeof(a));
if(N==0)
break;
int i,j,max=-1,max_i;
for(i=0;i<N;i++)
scanf("%s",str[i]);
for(i=0;i<N;i++)
{
for(j=i+1;j<N;j++)
{
if(strcmp(str[i],str[j])==0)
a[i]++;
}
}
for(i=0;i<N;i++)
{
if(a[i]>max)
{
max=a[i];
max_i=i;
}
}
printf("%s\n",str[max_i]);
}
return 0;
}