ZSC_ Winter Training 6

Description

An inch worm was at the bottom of a well n inches deep. It has enough-climb u inches every minute, but then have 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 is 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'll be multiple problem instances. Each line would contain 3 positive integers n, u and D. These give the values mentioned in the paragraph above. Furthermore, 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

1#include <iostream>2#include <cstring>3#include <cstdio>4#include <algorithm>5 using namespacestd;6 intMain ()7 {8     intn,u,d;9      while(SCANF ("%d%d%d", &n,&u,&d) && (n| | u| |d))Ten     { One         if((n-u)% (u-d) = =0) A         { -printf"%d\n", ((n-u)/(u-d)) *2+1); -         } the         Else -         { -printf"%d\n", ((n-u)/(u-d)) *2+3); -         } +     } -}

View Code

ZSC_ Winter Training 6