Let the Balloon Rise
来源:互联网 发布:kindle编程珠玑 编辑:程序博客网 时间:2024/04/27 14:01
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 64596 Accepted Submission(s): 23892
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
#include<iostream>#include<cstring>#include<cstdio>using namespace std;int main(){ int i,n,j,k,max=0; char s[1005][13]; int a[1004]; while(scanf("%d",&n)!=EOF) { memset(a,0,sizeof(a)); if(n==0) break; max=0; for(i=1;i<=n;i++) { scanf("%s",s[i]); } for(i=1;i<=n;i++) { for(j=i+1;j<=n;j++) { if(strcmp(s[i],s[j])==0) { a[i]++; } } if(a[i]>max) max=a[i]; } for(i=1;i<=n;i++) { if(a[i]==max) puts(s[i]); } } return 0;}
0 0
- 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
- Let the Balloon Rise
- Let the Balloon Rise
- GridView 行交换 GridView 行上移下移
- 递归的应用(一)
- windows2008系统 IIS7 下设置伪静态的方法
- C++回顾之拷贝构造函数
- 辗转相除法
- Let the Balloon Rise
- HTML5标准较量正酣
- 第一篇《角色问题》
- java系列总结(一)命名规范,数据类型,数组
- PL/SQL Nocopy
- [数论]POJ 3002 Jackpot 欧几里得算法
- 黑马程序员——网络编程
- CMMI与CSPO认证培训之我见——参加ShineScrum CSPO认证课有感
- 网卡驱动2-做一个与外界交互的虚拟网卡1(引用真实的网卡、自定义协议号注册)