本文主要是介绍HDU 1049 Climbing Worm，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1049
Climbing Worm
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 17249 Accepted Submission(s): 11809
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
Recommend
思路：大水题啊！暴力枚举一下就好了。详见代码。
附上AC代码：
#include <bits/stdc++.h>
using namespace std;
int n, u, d;int main(){while (~scanf("%d%d%d", &n, &u, &d) && n+u+d){int pos = 0;double t = 0.0;while (pos+u < n){pos += u-d;t += 2.0;}t += 1.0*(n-pos)/u;printf("%d\n", (int)ceil(t));}return 0;
}
这篇关于HDU 1049 Climbing Worm的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
