HDU 1049 Climbing Worm
来源:互联网 发布:身份证号码找人软件 编辑:程序博客网 时间:2024/05/22 18:56
Climbing Worm
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13790 Accepted Submission(s): 9340
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 1
20 3 1
0 0 0
Sample Output
17
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13790 Accepted Submission(s): 9340
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 1
20 3 1
0 0 0
Sample Output
17
19
一条虫子,一分钟向上爬了几米,然后要歇一分钟,在这一分钟内,也会滑下去几米,求多少分钟能爬到井口处。不解释,水题。
#include <iostream>#include <cstdio>using namespace std;int main(void){ // freopen("C.txt","r",stdin); int n,u,d; while(scanf("%d%d%d",&n,&u,&d),(n||u||d)) { int sum=0; int time=0; while(sum<n) { sum+=u;time++; if(sum<n) { sum-=d; time++; } } printf("%d\n",time); } 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
- TCP 登录实现代码
- supervisor管理tornado项目,参数丢失【待解决】
- Java中控制double类型小数点后位数的方法
- stm32f4 discovery开发板usb全速修改测试
- 欧拉工程第19题
- HDU 1049 Climbing Worm
- 机房重构--正则表达式
- 机器学习实战——Logistic回归
- 新浪微博开发之十七(图片工具)
- NodeJS数据对象获取
- bzoj-3211 花神游历各国
- 欢迎使用CSDN-markdown编辑器
- PHP将数组存入数据库中的四种方式
- Unity3d 真实的植物渲染