1494.cpp

ZOJ 动态规划算法题目入门与提高 源代码

#include<cstdio>

int main()
{
    int n,u,d;
    while(scanf("%d %d %d",&n,&u,&d)&&n)
    {
        n -= u;
        int ans=1;
        int t = u-d;
        if(n > 0 ) ans += 2*(n%t==0?n/t:int(n/t)+1);
        printf("%d\n",ans);
    } 

}