Let the Balloon Rise
来源:互联网 发布:投诉淘宝客服人员电话 编辑:程序博客网 时间:2024/05/21 10:29
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 92490 Accepted Submission(s): 35261
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<stdio.h>#include<string>#include<algorithm>using namespace std;int main(){ int N,i,count; string s[1000],c; while(scanf("%d",&N),N) { int max=-1; count=1; for(i=0;i<N;i++) cin>>s[i]; sort(s,s+N); for(i=0;i<N;i++) { while(s[i]==s[i+1] &&i<N-1) { count++; i++; } if(max<count) { c=s[i]; max=count; } count=1; } cout<<c<<endl; } 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
- Fragment的懒加载
- 第一章 初识hadoop
- 帧间预测(一)Void TComDataCU ::getInterMergeCandidates
- Swift语法特点
- this关键字和static关键字
- Let the Balloon Rise
- Android视图坐标体系总结
- 二叉树问题总结(一)
- Linux内核:工作队列
- 继承
- SSH搭建
- if语句和循环语句
- 07-图4 哈利·波特的考试
- 面向对象