首页 > 代码库 > hdu 1004 Let the Balloon Rise
hdu 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): 78140 Accepted Submission(s): 29345
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.
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.
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 | We have carefully selected several similar problems for you: 1013 1020 1006 1049 1017
#include<stdio.h>
#include<string.h>
main(){
char a[1001][16];
int n,t,i,j,m,b;
while(scanf("%d ",&n)&&n){
for(i=0;i<n;i++)
gets(a[i]);
m=1;
b=0;
for(i=0;i<n;i++)
{
t=1;
if(a[i][0]=='\0')
continue;
for(j=i+1;j<n;j++)
{
if(a[j][0]=='\0')
continue;
if(strcmp(a[i],a[j])==0)
{
t++;
a[j][0]='\0';
}
}
if(t>m)
{
m=t;
b=i;
}
}
printf("%s\n",a[b]);
}
}hdu 1004 Let the Balloon Rise
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。