We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. Algorithms
  3. Implementation
  4. Halloween Sale

Halloween Sale

You wish to buy video games from the famous online video game store Mist.

Usually, all games are sold at the same price, dollars. However, they are planning to have the seasonal Halloween Sale next month in which you can buy games at a cheaper price. Specifically, the first game you buy during the sale will be sold at dollars, but every subsequent game you buy will be sold at exactly dollars less than the cost of the previous one you bought. This will continue until the cost becomes less than or equal to dollars, after which every game you buy will cost dollars each.

For example, if , and , then the following are the costs of the first games you buy, in order:

You have dollars in your Mist wallet. How many games can you buy during the Halloween Sale?

Input Format

The first and only line of input contains four space-separated integers , , and .

Constraints

Output Format

Print a single line containing a single integer denoting the maximum number of games you can buy.

Sample Input 0

20 3 6 80

Sample Output 0

6

Explanation 0

We have , and , the same as in the problem statement. We also have dollars. We can buy games since they cost dollars. However, we cannot buy a th game. Thus, the answer is .

Sample Input 1

20 3 6 85

Sample Output 1

7

Explanation 1

This is the same as the previous case, except this time we have dollars. This time, we can buy games since they cost dollars. However, we cannot buy an th game. Thus, the answer is .