Let the Balloon Rise
来源:互联网 发布:qq邮箱软件下载 编辑:程序博客网 时间:2024/06/05 17:12
点击打开链接
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
本题时间复杂度n^2(n<=1000)可直接暴力;
代码:
#include<cstdio>#include<cstring>#include<algorithm>#define INF 0x3f3f3f3fusing namespace std;char s[1005][10];int main(){int n;while(~scanf("%d",&n),n){ int max=-INF; int maxk;for(int i=0;i<n;i++)scanf("%s",s[i]); for(int i=0;i<n;i++){ int k=0;for(int j=0;j<n;j++){if(strcmp(s[i],s[j])==0)k++;if(max<k){max=k;maxk=i; }}}printf("%s\n",s[maxk]);}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
- Utils総括
- mk路线
- oracle 新的数据库新的change
- Tomcat7 内存溢出
- A星寻路算法最简单理解
- Let the Balloon Rise
- Android gc垃圾回收流程
- 完美解决Sublime无法输入中文问题
- jks与keystore的区别
- Java 多图拼图并实现下载
- Servlet理论案例详解,面试必备
- 按输入序列长度为M,按其数据二进制中 ‘1’ 的个数多少,返回前N多的元素
- OpenCV统计米粒数目-计算联通区域的个数及联通区域内像素的个数
- 网站营销不等于网站建设