#C3729. Maximum Distance Runner

    ID: 47188 Type: Default 1000ms 256MiB

Maximum Distance Runner

Maximum Distance Runner

You are given the number of students and, for each student, two integers: the initial energy E and the energy loss per kilometer L. Each student can run until their energy is depleted. The maximum distance each student can run is computed as:

$$\text{distance} = \left\lfloor \frac{E}{L} \right\rfloor$$

This problem requires you to compute the maximum running distance for each student.

inputFormat

The input is given from stdin in the following format:

  • The first line contains an integer n, representing the number of students.
  • The next n lines each contain two space-separated integers E and L, where E is the initial energy and L is the energy loss per kilometer.

outputFormat

Output to stdout a single line containing n integers separated by a space. The i-th integer represents the maximum distance that the i-th student can run. Each maximum distance is computed using integer division as $$\left\lfloor \frac{E}{L} \right\rfloor$$.

## sample
3
10 2
15 3
20 4
5 5 5