zoukankan      html  css  js  c++  java
  • hdu1004 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
    这题用map做了一下,算是入门吧。
    #include<stdio.h> #include<iostream> #include<string> //这里一定要写 #include<string.h> #include<map> #include<algorithm> using namespace std; //string s; char s[2300][100],str[2000]; int main() { int n,m,i,j,max; map<string,int>hash; map<string,int>::iterator it,p; while(scanf("%d",&n)!=EOF && n!=0) { hash.clear(); memset(str,0,sizeof(str)); for(i=1;i<=n;i++){ //cin>>s; scanf("%s",s[i]); hash[s[i]]++; } max=0; for(it=hash.begin();it!=hash.end();it++ ){ if(it->second>max){ max=it->second; p=it; } } cout<<p->first<<endl; } return 0; }
  • 相关阅读:
    结构型设计模式——享元
    结构型设计模式——装饰模式
    结构型设计模式——外观
    结构型设计模式——桥接模式
    结构型设计模式——适配器模式(Go)
    创建型设计模式——工厂模式
    创建型设计模式——单例模式
    Linux03
    阅读《构建之法》八九十章
    作业五 5.2 5.3
  • 原文地址:https://www.cnblogs.com/herumw/p/9464812.html
Copyright © 2011-2022 走看看