zoukankan      html  css  js  c++  java
  • akoj-1073- Let the Balloon Rise

    Let the Balloon Rise

    Time Limit:1000MS  Memory Limit:65536K
    Total Submit:92 Accepted:58

    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

    #include <stdio.h>
    #include <string.h>
    int main()
    {
        int n,i,j,num[1000];
        int max=0,t=0;
        char color[1000][16];
        while(scanf("%d",&n)!=EOF)
        {
            if(n)
            {
                num[0]=0;
                scanf("%s",color[0]);
                for(i=1;i<n;i++)
                {
                    num[i]=0;
                    scanf("%s",color[i]);
                    for(j=0;j<i-1;j++)
                        if(strcmp(color[i],color[j])==0) num[i]+=1;
                }
                max=0;
                t=0;
                for(i=1;i<n;i++)
                   if(max<num[i]) 
                   {
                       max=num[i];
                       t=i;}
                printf("%s
    ",color[t]);
            }
            else break;
        }
    }


  • 相关阅读:
    BLAST
    用 python 实现各种排序算法(转)
    纠错工具之
    《生物序列分析》
    比对软件
    MySQL版本升级参考资料【转】
    解决mysql开启GTID主从同步出现1236错误问题【转】
    Linux系统打开core dump的配置【转】
    MySQL在线更改binlog格式
    关于MySQL 8.0的几个重点【转】
  • 原文地址:https://www.cnblogs.com/fayne/p/7224831.html
Copyright © 2011-2022 走看看