poj 3672 Long Distance Racing(水题)
2009-04-04 11:03
267 查看
纯数学。对于每一个unit,同时计算来回所要的时间。
#include<algorithm>
#include<iostream>
#include<stdio.h>
int main()
{
int m,t,u,f,d,ans=0;
char c;
int i;
bool flag;
scanf("%d%d%d%d%d",&m,&t,&u,&f,&d);
for(i=0;i<t;i++)
{
flag=0;
scanf("/n%c",&c);
// printf(" %c/n",c);
if(flag)
continue;
if(c=='u'||c=='d')
{
m-=u;
m-=d;
}
if(c=='f')
{
m=m-2*f;
}
if(m>=0)
ans++;
else
flag=1;
}
printf("%d/n",ans);
return 0;
}
#include<algorithm>
#include<iostream>
#include<stdio.h>
int main()
{
int m,t,u,f,d,ans=0;
char c;
int i;
bool flag;
scanf("%d%d%d%d%d",&m,&t,&u,&f,&d);
for(i=0;i<t;i++)
{
flag=0;
scanf("/n%c",&c);
// printf(" %c/n",c);
if(flag)
continue;
if(c=='u'||c=='d')
{
m-=u;
m-=d;
}
if(c=='f')
{
m=m-2*f;
}
if(m>=0)
ans++;
else
flag=1;
}
printf("%d/n",ans);
return 0;
}
相关文章推荐
- POJ-3672-Long Distance Racing-水题、%c输入要去除换行
- POJ 3672 Long Distance Racing
- POJ 3672 Long Distance Racing(水~)
- poj 3672 Long Distance Racing
- poj 3672 Long Distance Racing
- (Relax ST1.29)POJ 3672 Long Distance Racing(来回路问题..)
- POJ 3672 Long Distance Racing G++
- poj 3672 Long Distance Racing
- POJ 3672 Long Distance Racing (模拟)
- poj 3672 Long Distance Racing
- poj3672 Long Distance Racing留念下,惨痛的教训
- Long Distance Racing
- U - Long Distance Racing
- POJ 3672 水题......
- POJ 2602 Superlong sums (高精度,模拟,水题)
- U - Long Distance Racing
- POJ 3672 水题......
- U - Long Distance Racing
- I - Long Distance Racing(第二季水)
- POJ_P2774 Long Long Message/Codevs_P3160 最长公共子串(后缀数组)