码迷,mamicode.com
首页 > 其他好文 > 详细

hdu 1004

时间:2016-09-01 20:09:06      阅读:155      评论:0      收藏:0      [点我收藏+]

标签:

Let the Balloon Rise

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


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很好水,可是我wa了,因为map没清空,无奈
 1 #include<iostream>
 2 #include<cstring>
 3 #include<map>
 4 #include<string.h>
 5 #include<cstdio>
 6 #include<cmath>
 7 #include<algorithm>
 8 typedef long long ll;
 9 using namespace std;
10 int main()
11 {
12     map<string,int>str;
13     int n;
14     string a;
15     while(scanf("%d",&n)!=EOF)
16     {
17         if(n==0)
18             break;
19         int sum=0;
20         str.clear();
21         for(int i=0;i<n;i++)
22         {
23             cin>>a;
24             str[a]++;
25             sum=max(sum,str[a]);
26         }
27         map<string,int>::iterator it;
28         for(it=str.begin();it!=str.end();it++)
29         {
30             if(sum==it->second)
31             {
32                 cout<<it->first<<endl;
33             }
34         }
35     }
36 }

 

hdu 1004

标签:

原文地址:http://www.cnblogs.com/Aa1039510121/p/5831025.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!