1004
来源:互联网 发布:魅族系统升级清除数据 编辑:程序博客网 时间:2024/06/05 02:00
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 117296 Accepted Submission(s): 45953
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
Recommend
JGShining | We have carefully selected several similar problems for you: 1002 1001 1008 1005 1003
View Code
Problem : 1004 ( Let the Balloon Rise ) Judge Status : Accepted
RunId : 20161618 Language : C++ Author : 837274600
Code Render Status : Rendered By HDOJ C++ Code Render Version 0.01 Beta
RunId : 20161618 Language : C++ Author : 837274600
Code Render Status : Rendered By HDOJ C++ Code Render Version 0.01 Beta
#include<stdio.h>#include<string.h>#include<math.h>typedef struct Linknode{ char s[20]; int n; struct Linknode *next;}*Link;int main(){ int n; while (scanf("%d", &n) != EOF&&n) { Link p, q, A = new Linknode; A->next = NULL; while (n--) { p = new Linknode; p->n = 0; p->next = NULL; scanf("%s", p->s); q = A; while (q) { if (!strcmp(p->s, q->s)) { q->n++; q = q->next; } else if (q->next) q = q->next; else q->next = p; } } p = A; q = A->next; while (q) { if (q->n > p->n) p = q; q = q->next; } printf("%s\n", p->s); } return 0;}
0 0
- [1004]
- 1004
- 1004
- 1004
- 1004
- 1004
- 1004
- 1004
- 1004
- 1004
- 1004
- 1004
- 1004
- 1004
- 1004
- 1004
- 1004
- 1004
- 循环队列实现(通过设置标志位tag位判断空队满队)
- 交叉编译ncurses-6.0和minicom到ARM板
- [C++]Vector简介
- 数据库概述
- vm模板
- 1004
- tomcat解决某个文件读取失败(例如:以汉字命名的一张图片)的问题
- python基础实例
- CCF201312-2-ISBN号码
- 责任链模式和状态模式的区别
- poj 1308 Is It A Tree? (并查集)
- EasyJWeb-Velocity脚本简明教程
- The Blocks Problem (积木问题) -Uva101
- Python基础