Let the Balloon Rise(1004)
来源:互联网 发布:首创交易软件下载 编辑:程序博客网 时间:2024/06/05 20:34
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 74542 Accepted Submission(s): 27895
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
---------------------------------------------------------------------------------------------
F1:
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n,i,j,max;
while(cin>>n&&n!=0)
{
max=0;
string s[1005],color;
int num[1005];
for(i=1;i<1005;i++)
num[i]=0;
for(i=1;i<=n;i++)
{
cin >>color;
for(j=1;j<i;j++)
{
if(s[j].compare(color)==0)
{
num[j]++;
break;
}
}
if(j==i)
{
s[i]=color;
num[i]++;
}
}
for(i=1;i<=n;i++)
{
if(num[i]>num[max])
max = i;
}
cout<<s[max]<<endl;
}
return 0;
}
F2:
#include <stdio.h>
#include <string.h>
int main()
{
int n, i, j, t, max, num[1000];
char color[1000][16];
while(scanf("%d", &n) != EOF)
{
if(n)
{
num[0]=0;
scanf("%s", color[0]);
for(i=1; i <n; i++)
{
num[i]=0;
scanf("%s", color[i]);
for(j=0; j <i-1; j++)
if(strcmp(color[i], color[j])==0)
num[i] +=1;
}
max=num[0];
t=0;
for(i=1; i <n; i++)
if(max <num[i])
{
max =num[i];
t=i;
}
printf("%s\n",color[t]);
}
}
return 0;
}
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 74542 Accepted Submission(s): 27895
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
---------------------------------------------------------------------------------------------
F1:
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n,i,j,max;
while(cin>>n&&n!=0)
{
max=0;
string s[1005],color;
int num[1005];
for(i=1;i<1005;i++)
num[i]=0;
for(i=1;i<=n;i++)
{
cin >>color;
for(j=1;j<i;j++)
{
if(s[j].compare(color)==0)
{
num[j]++;
break;
}
}
if(j==i)
{
s[i]=color;
num[i]++;
}
}
for(i=1;i<=n;i++)
{
if(num[i]>num[max])
max = i;
}
cout<<s[max]<<endl;
}
return 0;
}
F2:
#include <stdio.h>
#include <string.h>
int main()
{
int n, i, j, t, max, num[1000];
char color[1000][16];
while(scanf("%d", &n) != EOF)
{
if(n)
{
num[0]=0;
scanf("%s", color[0]);
for(i=1; i <n; i++)
{
num[i]=0;
scanf("%s", color[i]);
for(j=0; j <i-1; j++)
if(strcmp(color[i], color[j])==0)
num[i] +=1;
}
max=num[0];
t=0;
for(i=1; i <n; i++)
if(max <num[i])
{
max =num[i];
t=i;
}
printf("%s\n",color[t]);
}
}
return 0;
}
0 0
- 1004 Let the Balloon Rise
- 1004 Let the Balloon Rise
- 1004 Let the Balloon Rise
- 1004let the balloon rise
- Let the Balloon Rise 1004
- 1004 Let the Balloon Rise
- Let the Balloon Rise(1004)
- 1004Let the Balloon Rise
- Let the Balloon Rise(1004)
- Let the Balloon Rise(1004)
- 1004:Let the Balloon Rise
- 1004 let the balloon rise
- 1004 Let the Balloon Rise
- 1004 Let the Balloon Rise
- 1004-Let the Balloon Rise
- 1004 Let the Balloon Rise
- 1004 Let the Balloon Rise
- 1004 Let the Balloon Rise
- 软件测试学习资料
- GridView 实现长按item拖动后,其它item自动移位效果
- (15)关于ListView中notifyDataSetChanged()刷新数据不更新原因
- java写的常见算法
- 【VMCloud云平台】SCDPM
- Let the Balloon Rise(1004)
- [我是面试官系列]如何判断一个人的执行力?
- Tomcat配置
- win7 32位安装oracle10g步骤
- asp.net 发送邮件程序
- 信号量和读写锁的区别
- 轻松搞定面试中的二叉树题目
- 解决此问题:07版WORD文档中的超链接、页码等变成了{HYPERLINK"网址"}、{PAGE}/{NUMPAGES}
- 帝国cms整合 ueditor