Climbing Worm

点击试做！

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

题目：
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

问题简述：

就是有一条虫子，要从井底爬到井口（只要爬到井口就行，不考虑虫子自身的长度问题），井底到井口总长为n，虫子的速度为每分钟爬u英里，每爬完一分钟就要休息一分钟，休息的途中会往下掉d英里，输入，n,u,d计算虫子爬到井口的时间。

通过舍友的帮助从runtime改为了accepted…

思路：
弄一个循环，爬一分钟爬了s路程，用时t分钟，考虑如果s>=n就跳出循环输出t，否则就继续计算，t加一，然后往下掉u英里，则实际走了s-d英里

hzu通过的代码如下：

#include <iostream>
using namespace std;
int main()
{
    int n, u, d, s = 0, t = 0;
    while (scanf_s("%d%d%d", &n, &u, &d))
    {
        if (n == 0) break;
        while (s < n)
        {
            t+=1;s += u;
            if (s >= n) break;
            t++;s -= d;
        }
        printf("%d\n", t);
        s = 0; t = 0;
    }
    
}