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

    Let the Balloon Rise

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


    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<map>
     3  #include<string>
     4  #include<string.h>
     5  using namespace std;
     6  map<string,int>mp;
     7  int main(){
     8      int N;
     9      char s[20],ans[20];
    10      while(~scanf("%d",&N),N){
    11          mp.clear();
    12          int temp=0;
    13          for(int i=1;i<=N;i++){
    14              scanf("%s",s);
    15              mp[s]++;
    16              //printf("mp[%s]=%d
    ",s,mp[s]);
    17              if(mp[s]>temp){
    18                  temp=mp[s];
    19                  strcpy(ans,s);
    20              }
    21          }
    22          printf("%s
    ",ans);
    23      }
    24      return 0;
    25  } 
  • 相关阅读:
    DataList嵌套DataList
    Enterprise Library: Data Access Application Block类设计分析篇
    一些web开发中常用的、做成cs文件的js代码 搜刮来的
    DataList小结
    kill 某个线程
    在JBOSS下发布Web程序
    调整命令行的列数和行数 mode con: cols=100 lines=10000
    了解JavaScript类
    http
    Notepad++文本比较插件:Compare
  • 原文地址:https://www.cnblogs.com/handsomecui/p/4820376.html
Copyright © 2011-2022 走看看