hdu1049

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
  
  

 

题意：一只虫每一秒钟可以爬u米，但是他要休息一秒，而且休息的时候就会往下掉d米，问你它要多久才能爬n米。

思路：其实这题我想了好久，就是不能简化出来。大致的方法就是：

总长为n，上升一秒走u,休息一秒下降d.

相当于每两秒走（u-d)；

先n-u,得到过了多少个u-d后超过n-u；

不太好理解，

代码：

</pre><pre name="code" class="html">
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int main()
{
    int u,n,d;
    while(~scanf("%d%d%d",&n,&u,&d)&&(u+n+d))
    {
        int time=(n-u)/(u-d);
        if(time*(u-d)<(n-u))
            time++;
        time*=2;
        time++;
        printf("%d\n",time);
    }
    return 0;
}