hdu -1049 Climbing Worm
来源:互联网 发布:优秀的java基础课程 编辑:程序博客网 时间:2024/05/21 19:21
Climbing Worm
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14400 Accepted Submission(s): 9719
Problem Description
An inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minute before climbing again. During the rest, it slips down d inches. The process of climbing and resting then repeats. How long before the worm climbs out of the well? We'll always count a portion of a minute as a whole minute and if the worm just reaches the top of the well at the end of its climbing, we'll assume the worm makes it out.
Input
There will be multiple problem instances. Each line will contain 3 positive integers n, u and d. These give the values mentioned in the paragraph above. Furthermore, you may assume d < u and n < 100. A value of n = 0 indicates end of output.
Output
Each input instance should generate a single integer on a line, indicating the number of minutes it takes for the worm to climb out of the well.
Sample Input
10 2 120 3 10 0 0
Sample Output
1719
Source
East Central North America 2002
//非常水的一道题,题意就是洞总长n英尺,每一分钟爬u英尺,然后休息一分钟,掉落d英尺;求出洞所用时间?
代码如下:
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
int main()
{
int n,u,d;
while(scanf("%d%d%d",&n,&u,&d)!=EOF,n)
{
int c=0;
while(n>0)//判断爬虫是否出界
{
if(n>0)//计算所用时间
{
n-=u;
c++;
if(n==0)
break;
}
// cout<<n<<endl;//测试数据
if(n>0)
{
n+=d;
c++;
}
//cout<<n<<endl;
}
cout<<c<<endl;//输出结果
}
return 0;
}
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
int main()
{
int n,u,d;
while(scanf("%d%d%d",&n,&u,&d)!=EOF,n)
{
int c=0;
while(n>0)//判断爬虫是否出界
{
if(n>0)//计算所用时间
{
n-=u;
c++;
if(n==0)
break;
}
// cout<<n<<endl;//测试数据
if(n>0)
{
n+=d;
c++;
}
//cout<<n<<endl;
}
cout<<c<<endl;//输出结果
}
return 0;
}
0 0
- HDU 1049 Climbing Worm
- hdu-1049 Climbing Worm
- HDU 1049 ( Climbing Worm )
- HDU 1049 Climbing Worm
- HDU 1049 Climbing Worm
- hdu 1049 Climbing Worm
- HDU 1049 Climbing Worm
- HDU--1049 -- Climbing Worm
- hdu-1049-Climbing Worm
- hdu 1049 Climbing Worm
- Climbing Worm- hdu-1049
- hdu 1049 Climbing Worm
- hdu 1049 Climbing Worm
- hdu 1049 Climbing Worm
- HDU 1049 Climbing Worm
- HDU 1049 Climbing Worm
- HDU 1049 Climbing Worm
- HDU 1049 Climbing Worm
- 安卓推送技术手册——使用透传消息的正确姿势
- php数组
- DedeCms 栏目增加缩略图功能的方法
- UI013---ImageView添加控件及tag说明
- 通过代码自定义TableViewCell(针对cell高度不一致)
- hdu -1049 Climbing Worm
- android 下载时文件名是中文和空格会报错解决方案
- bootstrap(警告框、按钮)
- 数据流中的中位数
- SQL基础知识
- Android 控件布局常用的属性
- dsp edma 拷贝和A8 DMA拷贝
- 使用HttpURLConnection通过GET、POST请求数据
- Dede使用channelartlist循环,不能获取外部链接的解决办法