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,每分钟爬d,每次休息一分钟下降u.输入 n d u 输出虫子爬出井的时间
代码1:简单模拟
#include<stdio.h>
int main()
{
int d,u,n,x,time;
while(scanf("%d %d %d",&n,&u,&d),n)
{ x=0;time=0;
while(1)
{
x+=u;time++;if(x>=n) break;
x-=d;time++;
}
printf("%d\n",time);
}
return 0;
}
代码2:数学方法
#include <iostream>
using namespace std;
int main(){
int n;
int u, d;
while (cin >> n >> u >> d){
if (n == 0) break;
int p = u - d;
int t = (n-u) / p;
int m = p * t;
if (n - m > u ) cout << 2 * t + 3 << endl;
else cout << 2 * t + 1 << endl;
}
return 0;
}