You are given an integer total representing an amount of money, and two integers cost1 and cost2 representing the price of a pen and a pencil, respectively.

Return the number of distinct ways to purchase some number of pens and pencils such that the total cost spent does not exceed total. You may purchase $0$ pens and $0$ pencils.

Constraints:

• $1 \leq$ total, cost1, cost2 $\leq 10^6$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.