杭电1004(map的应用)之Let the Balloon Rise
2016-11-06 15:13
459 查看
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
5
green
red
blue
red
red
3
pink
orange
pink
0
[align=left]Sample Output[/align]
red
pink
AC代码如下:
#include <iostream>
#include <map>
#include <string>
#include <cstring>
using namespace std;
map <string,int> s;
int main()
{
int n;
string str;
char a[1010][20];
while(cin>>n , n)
{
for(int i=0;i<n;i++)
{
cin>>a[i];
s[a[i]]++;
}
int maxi=0;
for(int i=0;i<n;i++)
{
if(s[a[i]]>maxi)
{
maxi=s[a[i]];
}
}
for(int i=0;i<n;i++)
{
if(s[a[i]]==maxi)
{
cout<<a[i]<<endl;
break;
}
}
}
return 0;
}
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
5
green
red
blue
red
red
3
pink
orange
pink
0
[align=left]Sample Output[/align]
red
pink
AC代码如下:
#include <iostream>
#include <map>
#include <string>
#include <cstring>
using namespace std;
map <string,int> s;
int main()
{
int n;
string str;
char a[1010][20];
while(cin>>n , n)
{
for(int i=0;i<n;i++)
{
cin>>a[i];
s[a[i]]++;
}
int maxi=0;
for(int i=0;i<n;i++)
{
if(s[a[i]]>maxi)
{
maxi=s[a[i]];
}
}
for(int i=0;i<n;i++)
{
if(s[a[i]]==maxi)
{
cout<<a[i]<<endl;
break;
}
}
}
return 0;
}
相关文章推荐
- map容器的应用:hdu 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise(map应用)
- HDU 1004 Let the Balloon Rise Map的应用
- 杭电ACM OJ 1004 Let the Balloon Rise 考察map和list的遍历
- Let the Balloon Rise(杭电ACM 1004)
- 杭电acm 1004 (Let the Balloon Rise)
- Hdu oj 1004 Let the Balloon Rise(map)
- 杭电1004——Let the Balloon Rise
- 【hdu 1004】Let the Balloon Rise(map)
- HDU 1004 Let the Balloon Rise(map)
- 杭电ACM 1004 Let the Balloon Rise
- 杭电 1004[Let the Balloon Rise]
- 杭电 1004 Let the Balloon Rise
- 杭电1004 Let the Balloon Rise
- HDU-1004 Let the Balloon Rise STL map
- 杭电 1004 Let the Balloon Rise
- HDU-#1004 Let the Balloon Rise(字符串+map)
- 杭电1004---Let the Balloon Rise
- hdu 1004 Let the Balloon Rise map
- HDU 1004 - Let the Balloon Rise(map 用法样例)