hdu1049——Climbing Worm

最新推荐文章于 2021-08-30 21:11:10 发布

原创最新推荐文章于 2021-08-30 21:11:10 发布 · 1.2k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#c++ #cpp #编程 #计算机 #数据

模拟专栏收录该内容

66 篇文章

订阅专栏

本文探讨了井爬虫问题，即一只昆虫在深井中上下爬行，每次爬升和休息后的下滑，计算它最终爬出井口所需的时间。通过输入井深、每分钟爬升高度和休息下滑距离，我们能够精确计算出爬虫完成这一过程的时间。

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

代码

#include<iostream>
using namespace std;
int main()
{
    int n,d,u,t1=0,t2=0,count;
    while(cin>>n>>d>>u&&n!=0)
    {
        t1=0;
        t2=0;
        count=0;
        while(count<=n)
        {
            count+=d;
            t1++;
            if(count>=n)break;
            count-=u;
            t2++;
        }
        cout<<t1+t2<<endl;
    }
    return 0;
}