zoukankan      html  css  js  c++  java
  • HDOJ 1004

    Let the Balloon Rise

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 45024    Accepted Submission(s): 15983


    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
     
     1 #include <stdio.h>
     2 #include <string.h>
     3 #include <stdlib.h>
     4 
     5 char ballons[1000][15];
     6 int sum[1000];
     7 int ballons_idx;
     8 int n;
     9 
    10 int InBallons(char* tmp)
    11 {
    12     int i;
    13     for (i=0;i<ballons_idx;i++)
    14     {
    15         if (strcmp(tmp,ballons[i]) == 0)
    16         {
    17             sum[i]++;
    18             return 1;
    19         }
    20     }
    21     return 0;
    22 }
    23 int FindMax()
    24 {
    25     int i, max=-1, idx=0;
    26     for (i=0;i<ballons_idx;i++)
    27     {
    28         if (sum[i]>max)
    29         {
    30             max = sum[i];
    31             idx = i;
    32         }         
    33     }
    34     return idx;
    35 }
    36 void main()
    37 {
    38     int i;
    39     char tmp[15];
    40     scanf("%d",&n);
    41 
    42     while(n)
    43     {
    44         ballons_idx = 0;
    45         memset(sum,0,sizeof(int)*1000);
    46         for (i=0;i<n;i++)
    47         {
    48             scanf("%s",tmp);
    49             if (InBallons(tmp) == 0)
    50             {
    51                 strcpy(ballons[ballons_idx++],tmp);
    52             }
    53         }
    54         printf("%s\n",ballons[FindMax()]);
    55         scanf("%d",&n);
    56     }
    57 }
  • 相关阅读:
    创建与合并分支
    Git丢弃本地修改
    《人月神话》小记
    财商培养
    赚钱有道,增加睡后收入
    学点经济学,升级认知
    保险小白普及知识
    管理决策、资源分配的最理想状态
    AI时代做一个终身学习者
    基于需求的测试
  • 原文地址:https://www.cnblogs.com/xing901022/p/2693783.html
Copyright © 2011-2022 走看看