HDU#1049:Climbing Worm
来源:互联网 发布:在淘宝上开网店程序 编辑:程序博客网 时间:2024/05/01 18:54
Time Limit: 1000MS
Memory Limit: 32768KB
64bit IO Format: %I64d & %I64u
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
AC代码如下:
#include<iostream>using namespace std;int main(){ int n,u,d; while(cin>>n>>u>>d&&(n!=0&&n!=0&&d!=0)) { int i=1,s=0; do { if(i%2==1) s+=u; else s+=(-1)*d; i++; }while(s<n); cout<<i-1<<endl; } return 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
- JSP页面输入汉字为乱码的解决办法
- H3C中批量端口添加到Vlan
- JQuery的Dom操作
- C++中cin、cin.get()、cin.getline()、getline()、gets()等函数的用法
- 王学岗WebView(一)
- HDU#1049:Climbing Worm
- web移动端事件总结
- HY项目中问题总结(tableview 的细节处理以及基类的使用)
- 设计模式(一) 基本概念
- C++预学习
- 一个由CountDownLatch引发的Bug
- C# 求解数学里的组合
- Linux使用操作命令
- LCS最长公共子序列(最优线性时间O(n))