HDU 1049 Climbing Worm
来源:互联网 发布:网络黄金egd崩盘了吗 编辑:程序博客网 时间:2024/06/06 13:13
题目链接: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 120 3 10 0 0
Sample Output
1719
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;}
1 0
- HDU 1049 Climbing Worm
- hdu-1049 Climbing Worm
- HDU 1049 ( Climbing Worm )
- HDU 1049 Climbing Worm
- HDU 1049 Climbing Worm
- hdu 1049 Climbing Worm
- HDU 1049 Climbing Worm
- HDU--1049 -- Climbing Worm
- hdu-1049-Climbing Worm
- hdu 1049 Climbing Worm
- Climbing Worm- hdu-1049
- hdu 1049 Climbing Worm
- hdu 1049 Climbing Worm
- hdu 1049 Climbing Worm
- HDU 1049 Climbing Worm
- HDU 1049 Climbing Worm
- HDU 1049 Climbing Worm
- HDU 1049 Climbing Worm
- The Grammer of Graphics 读书笔记 - Introduction
- 深刻理解正则表达式的"组"以及"?:"
- 数据结构实验之求二叉树后序遍历和层次遍历
- CodeForces 688A Opponents(群架)
- 设计模式-模板模式
- HDU 1049 Climbing Worm
- Apache Commons CLI
- hbase协处理器引发的问题解决方案
- poj 2442 Sequence(贪心,堆)
- Java关键字volatile
- map函数的应用
- 复习(数据结构):图:c语言:邻接矩阵DFS和BFS
- [机器学习]UC Irvine 数据集网的adults预测收入算法错误率
- HDU 1022 火车站(模拟栈)