HDU_1004 Let the Balloon Rise
来源:互联网 发布:视频剪辑合成软件app 编辑:程序博客网 时间:2024/05/17 02:52
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58567 Accepted Submission(s): 21505
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
5greenredblueredred3pinkorangepink0
Sample Output
redpink
Author
WU, Jiazhi
Source
ZJCPC2004
Recommend
JGShining
CODE:
#include<string.h>
int main()
{
char a[10001][16];
int i,j,num,max,t,flag;
while(scanf("%d",&num)!=EOF && num)
{
getchar();
for(i=0;i<num;i++)
gets(a[i]);
max=1;
flag=0;
for(i=0;i<num;i++)
{
t=1;
if(a[i][0]=='\0')continue; //判断字符串是否为空
for(j=i+1;j<num;j++)
{
if(a[j][0]=='\0')continue; //判断字符串是否为空
if(strcmp(a[i],a[j])==0)
{
t++; //记录颜色相同的气球数目
a[j][0]='\0'; //将比较过后的气球颜色变为空,以免重复计数
}
}
if(t>max) //找出数目最多的气球颜色
{
max=t;
flag=i; //记录数目最多的气球颜色的下标
}
}
puts(a[flag]); //输出最多数目的气球颜色
}
return 0;
}
- HDU_1004 Let the Balloon Rise
- HDU_1004 Let the Balloon Rise
- HDU_1004 Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the Balloon Rise
- Let the balloon rise
- Let the Balloon Rise
- android service生命周期分析与理解
- lucene series 2 document 文档 索引创建 基本索引操作
- SelectedIndexChanged事件
- 论这两年不断突破大家心理底线的互联网薪水
- json
- HDU_1004 Let the Balloon Rise
- Unique Binary Search Trees II
- maven常用命令
- 提高口才
- 可以检查多少位版Linux操作系统(32or64)的命令getconf
- 三目表达式
- c++对象模型研究4:函数
- Apache Maven 入门篇(下)
- 把年月日格式的时间转化成日历时间2013/8/21/10:20