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

    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
    #include<cstdio>
    #include<cstring>
    int main()
    {
        char s[1005][20];
        char temp[20];
        int a[1005];
        int n,i,j;
        while(1)
        {
            memset(a,0,sizeof(a));
            memset(temp,0,sizeof(temp));
            memset(s,0,sizeof(s));
            scanf("%d",&n);
            if(!n) break;
            for(i=0; i<n; i++)
                scanf("%s",s[i]);
            for(i=0; i<n-1; i++)
            {
                if(a[i]<0) continue;/*不这样做就会超时*/
                for(j=i+1; j<n; j++)
                {
                    if(a[j]<0) continue;
                    if(strcmp(s[i],s[j])==0)
                    {
                        a[i]++;
                        a[j]=-1;
                        strcpy(s[j],temp);
                    }
    
                }
            }
            int max=0,maxi=0;
            for(i=0; i<n; i++)
                if(a[i]>max)
                {
                    max=a[i];
                    maxi=i;
                }
            printf("%s
    ",s[maxi]);
    
    
        }
    }
    View Code
  • 相关阅读:
    正则表达式语法介绍
    关系型数据库和非关系型数据库的简单对比
    lambda函数
    java基础系列--Exception异常处理
    springBoot基础系列--properties配置
    spring基础系列--JavaConfig配置
    java基础系列--Calendar类
    java基础系列--Date类
    一个特殊的List去重问题的解决方案
    Java学习笔记
  • 原文地址:https://www.cnblogs.com/orchidzjl/p/4262847.html
Copyright © 2011-2022 走看看