ime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 23349 Accepted Submission(s): 15984
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英尺的墙,一条长1英尺的小虫子在墙下以u英尺每秒的速度向上爬,每爬一秒就休息一秒,休息时小虫子会下滑d秒。多次输入n,u,d,计算要多少秒小虫子才能爬上墙,结果一行输出,当遇到n=0时结束输出。
程序说明:
用while语句实现循环,中间插入if语句防止计算过度.
程序实现:
#include <iostream>
using namespace std;
int main()
{
int n, u, d, s =0, k =0;
while (cin >> n>> u >> d)
{
if (n == 0)
break;
while (k < n)
{
s += 1;
k += u;
if (k >= n)
break;
s++;
k -= d;
}
cout << s << endl;
s = 0; k = 0;
}
}