Taco Tasks Distribution

Tom has been assigned d days to complete a total of t tasks. In order to manage his workload efficiently, he decides to distribute the tasks as evenly as possible over the given days. Your task is to calculate the minimum number of tasks that Tom must perform on any single day, under the optimal plan. The answer is given by the formula \(\lfloor \frac{t}{d} \rfloor\), where \(\lfloor x \rfloor\) denotes the floor of \(x\).

Constraints:

• \(1 \leq d \leq 10^9\)
• \(0 \leq t \leq 10^9\)

Example: For \(d = 3\) and \(t = 10\), the minimum tasks per day will be \(\lfloor 10/3 \rfloor = 3\).

inputFormat

The input is read from standard input and consists of a single line containing two space-separated integers:

• d: the number of days
• t: the total number of tasks

outputFormat

Output to standard output a single integer representing the minimum number of tasks Tom must perform on any day according to the optimal plan.

3 10

3