HDU/HDOJ 1004 Let the Balloon Rise(颜色统计)
来源:互联网 发布:python 时间戳 整数 编辑:程序博客网 时间:2024/04/26 15:57
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 107654 Accepted Submission(s): 41780
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
Author
WU, Jiazhi
Source
ZJCPC2004
题意:
很明确的题意,就是统计出出现最多的颜色。
思路:
没学习结构体排序之前还真不知道怎么做,
不知道把颜色首字母转换为数字用一位数组对不对(毕竟存在BUG不知道颜色都是哪些)。
Code:
#include<stdio.h>#include<stdlib.h>#include<string.h>#include<math.h>#include<algorithm>#define MYDD 1103using namespace std;struct Q {char color[16];} balloons[MYDD];bool cmp_color(Q x,Q y) {//对气球颜色进行排序return strcmp(x.color,y.color)>0? 1:0;}int MAX(int x,int y) {return x<y? x:y;//}int main() {int n;char dd[16];//答案颜色while(scanf("%d",&n)&&n) {for(int j=0; j<n; j++)scanf("%s",balloons[j].color);sort(balloons,balloons+n,cmp_color);char now[16];//记录当前待比较的颜色int max=0;//记录最多气球颜色的个数int ans=0;//记录当前气球颜色的个数strcpy(now,balloons[0].color);strcpy(dd,balloons[0].color);for(int j=0; j<n; j++) {if(strcmp(now,balloons[j].color)==0)ans++;else {//颜色不同if(ans>max) {strcpy(dd,balloons[j-1].color);//ans 记录的是前一个气球颜色的个数max=ans;}strcpy(now,balloons[j].color);//极记为当前气球颜色ans=1;}}puts(dd);}return 0;}/*7C A B A B C C3a B C*/
0 0
- HDU/HDOJ 1004 Let the Balloon Rise(颜色统计)
- HDU(1004)Let the Balloon Rise
- hdu 1004 Let the Balloon Rise(trie||映射统计)
- HDU 1004 Let the Balloon Rise (字符统计)
- 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
- Java IO(二):IO流——字符流
- 百度地图后台持续定位<定位SDK-6.13>
- android4.0.3添加 Ethernet框架支持
- JS中常用到的数组工具方法
- 模运算的规则
- HDU/HDOJ 1004 Let the Balloon Rise(颜色统计)
- 通州十三五规划精华版:增几十万就业机会/一批地铁
- 关于Xcode编译性能优化的研究工作总结
- Ultra-Pull-To-Refresh动态添加View不能正常显示BUG解决方法
- js时间段列表生成方法
- Android自定义捕获Application全局异常
- hdu 1281 棋盘游戏 二分图匹配 匈牙利算法 暴力
- JAVA中的阻塞队列
- HelloWorld Driver