杭电ACM-HDU1004-Let the Balloon Rise
2015-10-29 15:15
337 查看
题目来自杭电ACM: acm.hdu.edu.cn
Total Submission(s): 93510 Accepted Submission(s): 35712
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
Sample Output
Author
WU, Jiazhi
Source
ZJCPC2004
代码如下:
这是一个较为简单的考察字符串的题目,通过头文件string.h中的strcmp函数来判断字符串是否相同。
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 93510 Accepted Submission(s): 35712
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.
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
Author
WU, Jiazhi
Source
ZJCPC2004
代码如下:
#include <stdio.h> #include <string.h> #define N 1010 int count ; char ballon [16]; int main() { int n, i, j; while (1){ scanf("%d", &n); if (n == 0){ break; } gets(ballon[0]); for (i = 1; i <= n; ++i){ gets(ballon[i]); } int max = 1, position = 1; for (i = 1; i <= n; ++i){ count[i] = 0; for (j = i; j <= n; ++j){ if (strcmp(ballon[i], ballon[j]) == 0){ count[i]++; if (count[i] > max){ max = count[i]; position = i; } } } } printf("%s\n", ballon[position]); } return 0; }
这是一个较为简单的考察字符串的题目,通过头文件string.h中的strcmp函数来判断字符串是否相同。
相关文章推荐
- Hibernate不同版本创建SessionFactory
- Android DiskLruCache 完全解析,硬盘缓存的最佳方案
- EditText之自定义边框颜色
- 素数问题_算数基本定理
- maven缺少依赖包,强制更新命令
- [Windows Server 2012] IIS自带FTP配置方法
- ci整合Smarty-3.1.18
- iOS 如何解决UITableView刷新卡顿现象
- 关于mysql的用户管理,笔记
- 素数问题_算数基本定理
- Android判断网络连接状态代码
- 解决linux 出现如下报错:Another app is currently holding the yum lock;
- 从头开始实现神经网络:入门
- 使用Linux正则表达式灵活搜索文件中的文本
- 「Maven Tips」(一)自动更新jar包
- dbus pc机上开发环境的建立
- Android开发学习:使用已有的sql数据库
- 实现二叉搜素树迭代器--进军硅谷
- opentld 出错解决方案
- Eclipse将引用了第三方jar包的Java项目打包成jar文件的两种方法