hdu 1004 Let the Balloon Rise
来源:互联网 发布:智能导游app 知乎 编辑:程序博客网 时间:2024/06/03 16:37
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 115909 Accepted Submission(s): 45426
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
#include<stdio.h>#include<string.h>int main(){ int acount,maxx,n; char a[1005][20],str[20]; while(scanf("%d",&n)&&n){ for(int i=0;i<1000;i++) memset(a[i],0,sizeof(char)*20) ; for(int i=0;i<n;i++) scanf("%s",a[i]); maxx=0; for(int i=0;i<n-1;i++){ acount=0; for(int j=1;j<n;j++){ if(!strcmp(a[i],a[j])) acount++; } if(acount>maxx) { memset(str,0,sizeof(char)*20); strcpy(str,a[i]); maxx=acount; } } if(maxx==0) printf("%s\n",a[0]); else printf("%s\n",str); } return 0;}
0 0
- HDU 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- HDU--1004 Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- Hdu 1004 - Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- HDU--1004--Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise STL
- C 语言程序开发范例宝典29
- PS菜鸟入门 -- 初识
- Property 'XXX' not found on type java.lang.String解决方案
- HDU1087 超级跳跃(递增子序列最大和)
- 使用指定范围随机数来初始化数组
- hdu 1004 Let the Balloon Rise
- Leetcode_Search for a Range
- 【bzoj 1486】 [HNOI2009]最小圈
- Spring Quartz 定时器任务
- javaweb 判断用户是否重复登入
- 关系型数据库与非关系型数据库 优缺点
- 【MFC】CDockablePane布局问题
- MathType公式编号与公式不在一行没有对齐
- 8. String to Integer (atoi)