题目描述:Climbing Worm |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 2562 Accepted Submission(s): 1516 |
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 |
Source
East Central North America 2002
|
题目不难,数据不大可以进行模拟。
但是建议推算
#include<stdlib.h>
#include<stdio.h>
int main()
{
int n,u,d;
while(scanf("%d %d %d",&n,&u,&d)==3&&n)
{
int sum=0;
sum=1+(n-u)/(u-d)*2;//表示最后一步刚好只上不下
if((n-u)%(u-d))//表示最后一步只上,走不完差一点,所以需要+2
sum+=2;
printf("%d\n",sum);
}
return 0;
}