YT14-先来练练手之爬动的蠕虫
来源:互联网 发布:python学要多久 编辑:程序博客网 时间:2024/06/11 18:43
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
代码如下:
#include <iostream> using namespace std; int main() { int n,u,d; while(cin>>n>>u>>d) { if(n==0&&u==0&&d==0) break; else { if(((n-u)%(u-d))==0) cout<<1+2*((n-u)/(u-d))<<endl; else cout<<1+2*(((n-u)/(u-d))+1)<<endl; } } return 0; }
0 0
- YT14-先来练练手之爬动的蠕虫
- YT14-先来练练手之奇数之积
- YT14-先来练练手之绝对值排序
- YT14-先来练练手之三角形分区
- YT14-先来练练手之蜜蜂与蜂房
- YT14-先来练练手之电梯RUNTIME
- YT14——先来练练手(1)
- YT14——先来练练手(2)
- YT14——先来练练手(3)
- YT14——先来练练手(4)
- YT14——先来练练手(5)
- YT14——先来练练手(6)
- YT14——先来练练手(7)
- 爬动的蠕虫
- 爬动的蠕虫
- 爬动的蠕虫
- 爬动的蠕虫
- 爬动的蠕虫
- Java Breakpoint
- windows安装JNetPca
- CentOS [Errno 14] PYCURL ERROR 6 错误如何解决
- Linux的文件权限和目录配置(一)
- NSValue(可以包装任意值)
- YT14-先来练练手之爬动的蠕虫
- unity3D之道具系统补全
- Binary Search Tree Iterator
- 栈的实现方式:顺序栈和链表栈 C语言
- Algorithm tutorials(动归) && minipaint
- python学习:字符串切片操作
- NSDate --- 日期
- 大数据基础架构详解
- JDK Proxy