HDU - 1004 Let the Balloon Rise (map)
2017-07-24 18:32
549 查看
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1004点击打开链接
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 124355 Accepted Submission(s): 49067
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
Source
ZJCPC2004
Recommend
JGShining
map简单应用
#include <iostream>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <stack>
#include <limits>
#include <string>
#include <string.h>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
map<string ,int > ::iterator it;
int main()
{
map<string ,int > mmap;
int n=0;
while(~scanf("%d",&n)&&n)
{
mmap.clear();
while(n--)
{
string s;
cin >> s;
mmap[s]++;
}
int sum=0;
string ans;
for(it=mmap.begin();it!=mmap.end();it++)
{
if((*it).second>sum)
{
sum=(*it).second;
ans=(*it).first;
}
}
cout << ans << endl;
}
}
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 124355 Accepted Submission(s): 49067
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
Source
ZJCPC2004
Recommend
JGShining
map简单应用
#include <iostream>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <stack>
#include <limits>
#include <string>
#include <string.h>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
map<string ,int > ::iterator it;
int main()
{
map<string ,int > mmap;
int n=0;
while(~scanf("%d",&n)&&n)
{
mmap.clear();
while(n--)
{
string s;
cin >> s;
mmap[s]++;
}
int sum=0;
string ans;
for(it=mmap.begin();it!=mmap.end();it++)
{
if((*it).second>sum)
{
sum=(*it).second;
ans=(*it).first;
}
}
cout << ans << endl;
}
}
相关文章推荐
- HDU 1004 Let the Balloon Rise(map键值的运用)
- HDU 1004 Let The Balloon Rise (简单map)
- HDU 1004 - Let the Balloon Rise(map 用法样例)
- ZOJ 2104/HDU 1004 Let the Balloon Rise(map容器)
- 【map热手题】HDU 1004—Let the Balloon Rise
- HDU-1004 Let the Balloon Rise(map)
- HDU 1004 Let the Balloon Rise Map的应用
- HDU 1004 Let the Balloon Rise【Map】
- hdu 1004 Let the Balloon Rise map
- HDU 1004 Let the Balloon Rise(map)
- HDU 1004 Let the Balloon Rise (map使用)
- map容器的应用:hdu 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise(map应用)
- HDU 1004 Let the Balloon Rise(Map)
- HDU 1004(map) Let the Balloon Rise
- HDU-#1004 Let the Balloon Rise(字符串+map)
- Let the Balloon Rise HDU - 1004 (用map,vector的解法)
- HDU-1004 Let the Balloon Rise STL map
- HDU 1004 Let the Balloon Rise(map)
- HDU-1004 Let the Balloon Rise(STL: map)