hdoj Let the Balloon Rise
2015-07-26 09:43
239 查看
/*Let the Balloon Rise
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*/
/*Let the Balloon Rise
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<stdio.h> #include<string.h> #include<stdlib.h> # define N 1005 char str [15]; int main() { int i,j,count[1000],t,n,k; while(scanf("%d",&n),n!=0) { t=0;记着要清零。 for(i=0;i<n;i++) scanf("%s",str[i]); memset(count,0,sizeof(int)*1000);//把count都初始为0 for(i=0;i<n;i++) { for(j=i+1;j<=n;j++) { if(strcmp(str[i],str[j])==0) { count[t]++; } } t++; } k=0; for(i=0;i<t;i++) { if(count[i]>=count[k]) k=i; } printf("%s\n",str[k]); } return 0; }
相关文章推荐
- C++ - Identifier not found
- 札幌中文离线地图App上线
- 浙江每380人有1人是千万富翁 80后百亿富豪诞生
- LoadRunner Controller阶段,脚本运行正常Passed Transactions 和Failed Transactions Errors 都没有数据显示?
- 第八章:加载Maya2011模型
- 沃尔玛被干翻 电商史里程碑的一刻
- Linux Shell篇之一:Shell编程简介
- C语言,猜字游戏
- thinkphp3.2 验证码生成和点击刷新验证码
- eclipse修改编辑字体大小
- 小樽中文离线地图App上线
- PAT (Advanced Level) 1046. Shortest Distance (20) 求环中两点之间的距离
- Android中AlertDialog的简单使用
- Java Socket应用(七)——使用多线程实现多客户端的通信
- 浅谈JavaScript中指针和地址
- wpf 如何将命名空间导入 XAML
- hdoj 1005 NUMBER Sequence
- 一些无特征PHP一句话
- union
- union