zoukankan      html  css  js  c++  java
  • ACM HDU 1004 Let the Balloon Rise

    Let the Balloon Rise

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


    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<iostream>
    using namespace std;
    int main()
    {
    char str[1001][16];
    int count[1001];
    int n,i,j,index;
    int cnt;
    while(scanf("%d",&n),n)
    {
    index
    =0;
    char temp[16];
    memset(count,
    0,sizeof(count));

    while(n--)
    {
    scanf(
    "%s",&temp);
    for(j=0;j<index;j++)
    {
    if(strcmp(temp,str[j])==0)
    {
    count[j]
    ++;break;
    }
    }
    if(j==index) {memcpy(str[index++],temp,sizeof(temp));count[j]++;}

    }
    for(i=0,cnt=0;i<index;i++)
    if(count[i]>count[cnt])cnt=i;
    printf(
    "%s\n",str[cnt]);
    }
    return 0;
    }
    #include<stdio.h>
    #include
    <string>
    #include
    <iostream>
    #include
    <map>
    using namespace std;
    const int MAXN=1000;

    int main()
    {
    map
    <string,int>color;
    string cnt;
    string index;
    int i;
    int n;
    int max;
    while(scanf("%d",&n),n)
    {
    max
    =0;
    for(i=0;i<n;i++)
    {
    cin
    >>cnt;
    color[cnt]
    ++;
    if(color[cnt]>max)
    {
    index
    =cnt;max=color[cnt];
    }

    }
    cout
    <<index<<endl;


    }
    return 0;
    }

  • 相关阅读:
    组合与计数
    20160929训练记录
    奇特而有用的定理
    图论 500 题
    《长安十二时辰》愿你看尽世间百态,心中仍有热血
    洛谷 [P1337] 平衡点
    洛谷 [P3496] BLO
    洛谷 [P2341] 受欢迎的牛
    洛谷 [P3723] 礼物
    洛谷 [P3338] 力
  • 原文地址:https://www.cnblogs.com/kuangbin/p/2117251.html
Copyright © 2011-2022 走看看