hdu1004 Let the Balloon Rise(二维字符串数组排序)
2015-07-21 21:14
447 查看
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 88886 Accepted Submission(s): 33639
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
Author
WU, Jiazhi
Source
ZJCPC2004
Recommend
JGShining | We have carefully selected several similar problems for you: 1008 1005 1013 1012 1006
Statistic | Submit | Discuss | Note
题目的意思就是找到单词重复次数最多的那个并输出。
起初以为知道都有那几种颜色,那样就把颜色存在一个二维字符串数组里面,输入一次比较一次,对应的sum(n)++。
后来一看没有说,就只能先对字符串排序,然后判断。由于只会结构体的字符串排序。。就这样吧。用结构体存字符串...
#include <stdio.h> #include <string.h> #include <algorithm> using namespace std; struct node { char color[20]; }c[1005]; bool cmp(node a,node b)//比较函数 { return strcmp(a.color,b.color)<0; } int main() { int n; while(scanf("%d",&n)!=EOF) { if(n==0) break; memset(&c,0,sizeof(&c)); for(int i=0;i<n;i++) scanf("%s",c[i].color); sort(c,c+n,cmp); int sum=0,max=-1,mark; for(int i=0;i<n;i++) { if(strcmp(c[i].color,c[i+1].color)==0) sum++; else { if(sum>max) max=sum,mark=i; sum=0; } } printf("%s\n",c[mark].color); } return 0; }
相关文章推荐
- TCP通信
- HDOJ 2072 单词数(map的简单题)
- Sparse_Table算法学习
- 杭电1106 排序
- HDOJ 统计难题 1251 【字典树】
- OAuth 授权
- 从零开始搭建hadoop分布式集群环境:(一)新建hadoop用户以及用户组
- 00-自测5. Shuffling Machine (20)
- 设计模式 --6大法则 --迪米特法则
- <将来的你一定会感谢现在拼命的自己>读书随笔
- POJ 题目3692 Kindergarten(最大独立集)
- 静态类和静态方法、接口和抽象类、内部类、单子设计模式
- 【多校第一场】【单调队列】HDU 5289 Assignment
- 利用树莓派做智能小车
- Objective-C设计模式——单例Singleton(对象创建)
- poj 2398 Toy Storage (计算几何,判断点和线段关系)
- java 接口。Android Interface 自定义接口回调。
- 获取Windows 10(2)
- LeetCode题解——Merge Sorted Array
- 二叉树 二叉树的性质 存储结构 遍历二叉树 C实现二叉树的创建和遍历 线索二叉树