Practice - 1 "Sofia the first". Linear Algorithms




Task
Time limit: 1000 ms,
Memory limit: 256 Mb

The favorite of Sofia Belchonok lives on a very high tree at an altitude of h miles. He wants to pick up a nut in his hollow. During the day, he rises with a nut a miles, and during the night, the nut rolls down b miles. On what day does the squirrel raise the nut to its hollow?
It is forbidden to use any algorithmic constructs (if, while, for, etc.), except for arithmetic operations

Input: The program receives natural numbers h, a, b as input.
Output: The program should print one natural number. It is guaranteed that a> b.

Example
Input Output
1 10
3
2
8

Prohibited statements:if;for;while;?;max;min;import

Auto CHOOSE THE PROGRAMMING NECESSARY LANGUAGE!
Attach the program source file:
or enter the source code in the language:

Rules for designing programs and a list of errors during automatic task verification
           

Results: