Let the Balloon Rise
2015-08-10 17:28
197 查看
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 90162 Accepted Submission(s): 34230
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.
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.
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
水水水。。。
Total Submission(s): 90162 Accepted Submission(s): 34230
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.
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.
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
水水水。。。
#include<string.h> #include<stdio.h> #include<algorithm> #define max 1010 using namespace std; struct stu { char s[max]; int w; }a[max]; int cmp(stu c,stu b) { return c.w>b.w; } int main() { int n,i,j; while(scanf("%d",&n),n) { for(int i=0;i<n;i++) { getchar(); scanf("%s",&a[i].s); a[i].w=1;//初始化赋值为一,它本身就算是有一个 } for(int i=0;i<n;i++) { for(int j=0;j<i;j++) { if(strcmp(a[i].s,a[j].s)==0) a[i].w++;//不可写作a[i].w+=a[j].w;经过循环,a[i].w的值早已不为一 } } sort(a,a+n,cmp); printf("%s\n",a[0].s); } return 0; }
相关文章推荐
- BZOJ1006
- Android屏幕适配全攻略(最权威的官方适配指导)
- UITableVIew 滚动流畅性优化
- Java Web基础——自定义标签和JSTL
- 【Java并发编程实战】—–“J.U.C”:锁,lock
- ZooKeeper典型应用场景
- Shell之date用法
- hibernate学习系列-----(8)hibernate对集合属性的操作之Collectioon集合篇
- JavaScript 开发的44个经典技巧
- js改变,设置table单双行颜色,jquery改变,设置table单双行颜色
- 二分图匹配知识汇总+题目链接
- mysql的初始化配置及命令行选项
- 在线QQ代码设置
- mysql复制原理
- BMW BENZ AUDI 宝马,奔驰,奥迪维修标准工时,从KSD,WIS, ELSA 中提取。
- HDOJ-2008-数值统计
- hdoj-1034-Candy Sharing Game
- 数据结构上机实验之二分查找
- CSDN学院 免费技术答疑公开课,本周四场即将开播~~~
- C++_布局(placement)new操作符