Climbing Worm

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 Input10 2 1
20 3 1
0 0 0
Sample Output17
19
Source East Central North America 2002
Recommend We have carefully selected several similar problems for you: 1008 1021 1019 1005 1108
问题链接http://acm.hdu.edu.cn/showproblem.php?pid=1049
问题分析1.此次思路要明确，便十分简单了。
2.绝对不能想当然以为用排上的路程减去掉下来的路程（d-u），然后用总的来除以他（n/（d-u）），因为要考虑爬到顶了就不会掉了的问题，所以正确的方法应该是爬一分钟就（n-d）时间+1，掉一分钟就（n+u）时间+1。其中改变后的n代表的是到顶的距离。
AC的代码如下#include <iostream> using namespace std; int main() { int n, u, d,time; while (cin >> n >> u >> d) { time = 0; if (n == 0||u==0)break; for (;;) { if (n - u <= 0) { time++; break; } if (n - u > 0)time++; n = n - u + d; time++; } cout << time << endl; } }