杭电 1004 Let the Balloon Rise
2017-03-23 16:43
337 查看
[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
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
int num[1000];
char color[1000][16];
while(cin>>n)
{
if(n)
{
num[0]=0;
cin>>color[0];
for(int i=1;i<n;i++)
{
num[i]=0;
cin>>color[i];
for(int j=0;j<i;j++)
{
if(strcmp(color[i],color[j])==0)
num[i]++;
}
}
int max=num[0];
int sign=0;
for(int i=1;i<n;i++)
{
if(max<n
4000
um[i])
{
max=num[i];
sign=i;
}
}
cout<<color[sign]<<endl;
}
}
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
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
int num[1000];
char color[1000][16];
while(cin>>n)
{
if(n)
{
num[0]=0;
cin>>color[0];
for(int i=1;i<n;i++)
{
num[i]=0;
cin>>color[i];
for(int j=0;j<i;j++)
{
if(strcmp(color[i],color[j])==0)
num[i]++;
}
}
int max=num[0];
int sign=0;
for(int i=1;i<n;i++)
{
if(max<n
4000
um[i])
{
max=num[i];
sign=i;
}
}
cout<<color[sign]<<endl;
}
}
return 0;
}
相关文章推荐
- 杭电ACM(1004) Let The Balloon Rise
- 杭电ACM OJ 1004 Let the Balloon Rise 考察map和list的遍历
- 杭电1004之Let the Balloon Rise
- 杭电ACM 1004 “+Let+the+Balloon+Rise”
- 杭电 1004 Let the Balloon Rise
- 杭电1004——Let the Balloon Rise
- 杭电ACM 1004 Let the Balloon Rise
- 杭电ACM 1004 Let the Balloon Rise
- 杭电1004(map的应用)之Let the Balloon Rise
- 杭电1004——Let the Balloon Rise
- Let the Balloon Rise(杭电ACM 1004)
- 杭电 acm 1004 Let the Balloon Rise
- 杭电1004 Let the Balloon Rise
- 杭电1004: Let the Balloon Rise
- 杭电acm 1004 (Let the Balloon Rise)
- 杭电HDU 1004 Let the Balloon Rise AC代码 简单题
- HDOJ杭电1004 Let the Balloon Rise
- 杭电1004-Let the Balloon Rise
- 【杭电】 1004 Let the Balloon Rise
- 杭电1004_Let the Balloon Rise