haoj Climbing Worm 【水题】

最新推荐文章于 2018-09-11 17:29:33 发布

小破孩儿9561

最新推荐文章于 2018-09-11 17:29:33 发布

阅读量344

点赞数

分类专栏：基础题杭电oj

本文链接：https://blog.csdn.net/qq_21654717/article/details/49559139

版权

杭电oj 同时被 2 个专栏收录

98 篇文章 0 订阅

订阅专栏

基础题

27 篇文章 0 订阅

订阅专栏

Climbing Worm

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14959 Accepted Submission(s): 10137

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

Sample Output

  
  
   
   17
19
  
  
  
  
   
   代码：
  
  
  
  
   
   #include<cstdio>
#include<cstring>
int aa,bb;
int main()
{
	int h,w,c;
	while(scanf("%d%d%d",&h,&w,&c)!=EOF)
	{
		if(h==0&&w==0&&c==0)
		break;
		int aa=1;
		h-=w;
		while(h>0)
		{
			h-=w;
			aa++;
			h+=c;
			aa++;
		}
		printf("%d\n",aa);
	}
	return 0;
}