hdoj1004

翻译 2012年03月31日 15:02:17

Let the Balloon Rise

                                                                         Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
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
 

Recommend
JGShining
#include<stdio.h>
#include<string.h>

#define M 1000

int N;

char string[15]; //暂时存放气球名称

int max; //最多的那种气球有多少个

int mkind; //数量最多的气球的序号

struct ballon {//气球结构,name表示名称,number表示数量
    char name[15];
    int number;
} ballon[M];

void find(char *string) {
    int i;
    for (i = 0; strcmp(string, ballon[i].name) && ballon[i].number; i++);
    //跳出循环的时候,ballon[i].number==0表示前面没出现过这种气球,strcmp(string,ballon[i].name)==0表示前面出现过这种气球
    if (!ballon[i].number)//如果ballon[i].number==0,表示前面没出现过这种气球,需要在气球数组中添加一个元素
        strcpy(ballon[i].name, string);
    ballon[i].number++;
    if (ballon[i].number > max) {//如果该气球数量大于max,把max更新为这种气球的数量,kind更新为这种气球的序号
        max = ballon[i].number;
        mkind = i;
    }
}

int main(void) {
    while (scanf("%d", &N) && N) {
        memset(ballon, 0, sizeof (ballon));
        max = -1;
        mkind = -1;
        for (int i = 0; i < N; i++) {
            scanf("%s", string);
            find(string);
        }
        printf("%s\n", ballon[mkind].name);
    }
    return 0;
}



相关文章推荐

HDOJ1004

hdoj1004 解题代码 答案

  • 2011-09-12 14:09
  • 982B
  • 下载

Num 12: HDOJ: 题目1004 : Let the Balloon Rise( 字符串问题 )

原题链接 题目: Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 6...

HDOJ - 1004 - Let the Balloon Rise(字符串)

方法:快排后找出现次数最多的。 #include #include #include #include #include #include ...

HDOJ 1004 字符串处理(字符串统计)

Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Oth...

HDOJ 1004 java代码实现--引用相等要用 equals()

HDOJ 1004 引用需使用equals()方法判断

HDOJ1004字符串

/* 重复字符串统计 重复的,提前计数 新出现的,先新建,再计数 */ #include #include #include #include #include #include...

HDOJ 1004 Let the Balloon Rise(水题)

Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Ot...

HDOJ<1004>Let the Balloon Rise

超级心累的一道题。。。

HDOJ 1004 Java 答案

HDOJ 1004 Java
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)