HDOJ-1004 Let the Balloon Rise
来源:互联网 发布:电脑启动后网络连接慢 编辑:程序博客网 时间:2024/05/07 10:02
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 68800 Accepted Submission(s): 25517
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
#include <stdio.h>#include <string.h>int main(){ char a[1000][16],num[1000],max; int n,i,j,t; while(scanf("%d",&n)!=0) { num[0]=0;//注意 scanf("%s",&a[0]);//注意 for(i=1; i<n; i++) { scanf("%s",&a[i]); for(j=1; j<i-1; j++)//比对字符串 统计个数 { if(strcmp(a[i],a[j])==0) num[i]++; } } max=a[0]; t=0; for(i=1; i<n; i++)//找出个数最多 { if(max<a[i]) { t=i; max=a[i]; } } printf("%s\n",a[t]); }}
0 0
- HDOJ 1004 Let the Balloon Rise (map)
- HDOJ-1004 Let the Balloon Rise
- HDOJ 1004 Let the Balloon Rise
- HDOJ 1004 Let the Balloon Rise
- hdoj 1004 Let the Balloon Rise
- hdoj.1004 Let the Balloon Rise 20140726
- HDOJ Let the Balloon Rise 1004
- HDOJ 1004 Let the Balloon Rise
- HDOJ 1004 Let the Balloon Rise
- HDOJ 1004 Let the Balloon Rise(水题)
- 【HDOJ】【1004】Let the Balloon Rise
- HDOJ 1004 Let the Balloon Rise
- HDoj 1004 Let the Balloon Rise
- HDOJ 1004 Let the Balloon Rise
- HDOJ 1004 Let the Balloon Rise
- hdoj 1004 Let the Balloon Rise (map)
- HDOJ 1004 Let the Balloon Rise
- HDOJ 1004 Let the Balloon Rise
- 高速SPI以太网控制芯片-W5200
- SVN下载Google Code源代码的简单方法
- Linux程序设计 清空标准输入缓冲区
- strings和nm命令
- 小学生作文
- HDOJ-1004 Let the Balloon Rise
- 【翻译】探究Ext JS 5和Sencha Touch的布局系统
- jstring转换到C语言所用的char
- 第九周编程作业
- c语言中int与float数据运算时,数据转换问题
- LeetCode – Implement strStr() (Java)
- C++实现二进制、八进制、十进制、十六进制的相互转换
- Contiki-developers
- 小学生作文大厦