CDZSC_2015寒假新人（1）——基础 F

时间：2015-01-23 13:03:41 阅读：258 评论：0 收藏：0 [点我收藏+]

标签：

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

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
#ifdef CDZSC_OFFLINE
    freopen("in.txt","r",stdin);
#endif
    int n,u,d,sum,ans;
    while(scanf("%d%d%d",&n,&u,&d)&&n!=0&&u!=0&&d!=0)
    {
        sum=0,ans=0;
        while(sum+u<n)
        {
            sum+=u-d;
            ans+=2;
        }
        printf("%d\n",ans+1);
    }
    return 0;
}
View Code
 

CDZSC_2015寒假新人（1）——基础 F

标签：

原文地址：http://www.cnblogs.com/Wing0624/p/4243832.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行