HDU 1049.Climbing Worm "Water! Water! Water! "August 25"

Climbing Worm

Problem Descriptionan inch worm is at the bottom of a well n inches deep. It has enough-climb u inches every minute, but then have 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 is 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.

Inputthere'll be multiple problem instances. Each line would contain 3 positive integers n, u and D. These give the values mentioned in the paragraph above. Furthermore, assume D < u and N < 100. A value of n = 0 indicates end of output.

Outputeach input instance should generate a single integer on a line, indicating the number of minutes it takes for the Wo RM to climb off of the well.

Sample Input

10 2 120 3 10 0 0

Sample Output

1719

1s rise a,1s down b, the time required to rise L. Water! The code is as follows:

#include <cstdio>int main () {    int l,a,b;    while (scanf ("%d%d%d", &l,&a,&b) ==3&&a| | b| | L) {        int s=0,len=0;        while (len<l) {            len+=a;            s++;            if (len>=l) break;            len-=b;            s++;        }        printf ("%d\n", s);    }    return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

HDU 1049.Climbing Worm "Water! Water! Water! "August 25"