标签：des style color java os strong io for
Climbing Worm
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12245 Accepted Submission(s): 8254
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
模拟：
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
int main ()
{
int k,n,m;
while(cin>>k>>n>>m)
{
if(k==0&&n==0&&m==0) break;
int sum=0;
int t=0;
while(sum<k)
{
sum+=n;
t++;
if(sum>=k)
break;
sum-=m;
t++;
}
cout<<t<<endl;
}
return 0;
}
hdu 1049 Climbing Worm,布布扣,bubuko.com
hdu 1049 Climbing Worm
标签：des style color java os strong io for
原文地址：http://blog.csdn.net/fyxz1314/article/details/38358973
