hdu 1004 Let the Balloon Rise
来源:互联网 发布:怎么挑选电子琴知乎 编辑:程序博客网 时间:2024/06/04 20:13
Problem DescriptionContest 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.
InputInput 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.
OutputFor 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 Input5greenredblueredred3pinkorangepink0
Sample Outputredpink
//对于这道题,没有明确规定又多个受欢迎的球怎么处理,只有默认输出最面一个
#include<stdio.h>#include<string.h> int main() { int n,i,j,max,t; char a[1010][20]; int b[1010]; while(scanf("%d",&n),n) { memset(b,0,sizeof(b)); //此处的memset要放在循环里面 for( i=0;i<n;i++) scanf("%s",a[i]); for(i=0;i<n;i++) { for(j=0;j<n;j++) if(strcmp(a[i],a[j])==0) b[i]++; } max=b[0]; t=0; for(i=0;i<n;i++) { if(max<b[i]) { max=b[i]; t=i; } } puts(a[t]);//puts()自动换行 } return 0; }
This year, they decide to leave this lovely job to you.
A test case with N = 0 terminates the input and this test case is not to be processed.
5greenredblueredred3pinkorangepink0
redpink
//对于这道题,没有明确规定又多个受欢迎的球怎么处理,只有默认输出最面一个
#include<stdio.h>#include<string.h> int main() { int n,i,j,max,t; char a[1010][20]; int b[1010]; while(scanf("%d",&n),n) { memset(b,0,sizeof(b)); //此处的memset要放在循环里面 for( i=0;i<n;i++) scanf("%s",a[i]); for(i=0;i<n;i++) { for(j=0;j<n;j++) if(strcmp(a[i],a[j])==0) b[i]++; } max=b[0]; t=0; for(i=0;i<n;i++) { if(max<b[i]) { max=b[i]; t=i; } } puts(a[t]);//puts()自动换行 } 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
- 飞凌OK6410-A学习记录1---宿主机环境配置
- 细说php(三) 运算符与表达式
- 总结
- coco2dx内存管理(源码版本:cocos2d-x-2.2.3)
- 堆排序 原文地址:http://blog.csdn.net/morewindows/article/details/6709644
- hdu 1004 Let the Balloon Rise
- open与fopen区别
- hadoop(HDFS) Commons-logging Log4j
- 【Android游戏开发十九】(必看篇)SurfaceView运行机制详解—剖析Back与Home按键及切入后台等异常处理!
- 2014暑假集训搜索专题
- 2025 查找最大元素
- hdu4585 & BestCoder Round #1 项目管理(vector运用)
- 使用WireShark简单分析ICMP报文
- 网络拓扑距离的高效KNN查询