Hdu 1049

wangxiaoming 2014-10-22 22:21:47

456

本文链接：https://blog.csdn.net/wangming520liwei/article/details/40355821

版权

Climbing Worm

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12570 Accepted Submission(s): 8491

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

Sample Output

  
   17
19

Source

East Central North America 2002

题目大意：

水题一道，说看注释吧

#include<iostream>
#include<cstdio>
using namespace std;

int main()
{
    //题目大意 就是一共有N步 虫值每分钟走u 步 然后休息一分钟后d步
    int n , d , u;
    while(scanf("%d%d%d", &n, &u, &d), n)
    {
        int len = 0;//用来记录虫子走的路程
        int sum = 0 ;//用来记录时间
        while(len < n)
        {
            sum += 1;
            len += u;
            if(len >= n)
            {//大于等于那么退出
                break;  //跳出循环的条件
            }
            len -= d; //休息一分钟
            sum += 1;
        }
        printf("%d\n", sum);
    }

}