H - Climbing Worm解题报告（张宇）

H - Climbing Worm

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  HDU 1049

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
       

 

题意：给出高度n，每分钟爬的高度u，休息时每分钟下滑的高度。先爬一分钟再休息一分钟，如此类推，直到爬到了高度n。求花了多少分钟。当n=0时结束。又是小学生数学题呀，有木有！！！

[cpp]  view plain copy

1. #include<iostream>  
2. using namespace std;  
3. int main()  
4. {  
5.     int n,u,d;  //n表示要爬的高度,u表示每分钟爬的高度,d表示每爬完一分钟后休息的一分钟内下滑的高度  
6.     while(cin>>n>>u>>d)  
7.     {  
8.         if(n==0)   //n=0时结束  
9.             break;  
10.         int min;   //记录所花的时间  
11.         int dis=0;  //记录已爬的高度  
12.         for(min=1;;min++)  
13.         {  
14.             //先爬一分钟,再休息一分钟  
15.             if(min%2==0)    
16.             {  
17.                 dis-=d;  
18.             }  
19.             else  
20.             {  
21.                 dis+=u;  
22.                 if(dis>=n) //如果达到了高度n,结束  
23.                     break;  
24.             }  
25.         }  
26.         cout<<min<<endl;  
27.     }  
28.     return 0;  
29. }