HDU-1049-Climbing Worm(C++ && 编程初学者的题......)
2015-06-14 13:32
686 查看
Climbing Worm
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14196 Accepted Submission(s): 9560
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
We have carefully selected several similar problems for you: 1021 1019 1108 1071 1009
没什么好解释的,题目意思很明确,讲的是一个小虫子想要爬出水井的故事!(我也得尽快爬出水井......)
#include<iostream> #include<cstdio> using namespace std; int main() { int n,u,d; while(scanf("%d%d%d",&n,&u,&d)!=EOF) { if(n==0) break; int s=0,t=0; while(s<n) { s+=u; t++; if(s>=n) { break; } s-=d; t++; } printf("%d\n",t); } return 0; }
相关文章推荐
- 一步步将vim改造成C/C++开发环境(IDE)
- 【Search in Rotated Sorted Array II 】cpp
- C/C++中##与#的使用
- c语言中如何实现可变参数
- C语言中通过按位与求奇偶源码
- 【leetcode c++】14Longest Common Prefix
- _int64 C语言中怎么用
- C++ 虚析构函数 分析
- C/C++程序员面试易错题
- C++精确计算代码执行时间精度微秒级
- c++ 模板联系4
- c++ 模板联系4
- c++ 模板练习2
- C++ 一般模板友元关系
- C++ 一般模板友元关系
- c++ 模板练习2
- C++ 模板练习1
- C++ 模板练习1
- Effective C++条款03解读:尽可能使用const
- c++中调用cygwin/x使用ncl