ACM STEP 1.2.1 Climbing Worm

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

ninshine

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

阅读量626

点赞数

CC 4.0 BY-SA版权

分类专栏：杭电HDOJ 文章标签： ACM C c++ 杭电

本文链接：https://blog.youkuaiyun.com/u010285246/article/details/12622773

杭电HDOJ 专栏收录该内容

28 篇文章

订阅专栏

Climbing Worm

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 2609 Accepted Submission(s): 1548

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 <iostream>
using namespace std;
class climb
{
public:
    void set();
    void calc();
    void display();
    int p;
private:
    int a;
    int b;
    int c;
    int day;
};

int main(int argc, const char * argv[])
{
    climb t;
    t.set();
    while(t.p)
    {
        t.calc();
        t.display();
        t.set();
    }
    return 0;
}

void climb::set()
{
    cin >>a;
    cin >>b;
    cin >>c;
    day=0;
    if(a!=0&&b!=0&&c!=0)
    p=1;
    else p=0;
}

void climb::calc()
{
    if(a==0) {
        day=0;
        return;
    }
    if(a-b<=0) {
        day=1;
        return;
    }
    else{
        a-=b;
        day=1;
        int s;
        s=b-c;
        if(a%s==0)
            day+=a/s*2;
        else
            day+=a/s*2+2;
        
    }
}

void climb::display()
{
    cout <<day<<endl;
}