贪心专题-HDU 1049

最新推荐文章于 2021-09-05 13:04:37 发布

LZK1997

最新推荐文章于 2021-09-05 13:04:37 发布

阅读量342

点赞数

分类专栏：贪心专题文章标签：贪心 HDU

本文链接：https://blog.csdn.net/LZK1997/article/details/72236491

版权

贪心专题专栏收录该内容

5 篇文章 0 订阅

订阅专栏

这篇博客详细探讨了如何使用贪心策略解决HDU 1049问题——Climbing Worm。通过AC代码展示了解题思路，帮助读者理解贪心算法在实际问题中的应用。

摘要由CSDN通过智能技术生成

Climbing Worm

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

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

Source

East Central North America 2002

Recommend

We have carefully selected several similar problems for you: 1108 1071 1061 1170 1425

向上取整就好，水题，不多解释了

ac代码

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>

using namespace std;

int main()
{
    int n,u,d;

    while(~scanf("%d%d%d",&n,&u,&d),n){
        int tmp;
        tmp=ceil( ( n - u ) *1.0 / ( u - d ) )*2;
    //    printf("tmp=%d\n",tmp);
        printf("%d\n",tmp+1);
    }


    return 0;
}