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寸长的洞里爬,一分钟爬a寸,后要休息一分钟,期间下落b寸,求几分钟后能爬出去。
问题分析:在到达最后一次钱,蜗牛每两分钟爬a-b寸,最后一次不用休息直接爬出。
AC通过的C语言程序如下:
Code Render Status : Rendered By HDOJ C++ Code Render Version 0.01 Beta
#include <iostream>
using namespace std;
int main()
{
int n, u, d, a = 0;
while (cin >> n >> u >> d)
{
if (n == 0) return 0;
while (n - u > 0)
{
a += 2;
n -= (u - d);
}
cout << a + 1 << endl;
a = 0;
}
}