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英尺,问花多长时间能爬出井。
注意蠕虫在爬到顶部的时候就已经爬出,即不再下滑,所以要考虑最后的状态。
直接暴力解决
源代码:
#include <iostream> #include <cmath> #include <algorithm> #include <string> #include <iomanip> using namespace std; int main() { int n,u,d; while (cin>> n >> u >> d) { if (n == 0 && u == 0 && d == 0) break; int sum_time = 0; while (1) { n -= u; sum_time += 1; if (n <= 0) break; n += d; sum_time += 1; } cout<<sum_time << endl; } return 0; }