Minimum Trips Calculation

Given a number of test cases and for each test case two integers \(n\) and \(k\), determine the minimum number of trips required to transport \(n\) units, if each trip can carry at most \(k\) units. The minimum number of trips is computed by the formula \(\lceil \frac{n}{k} \rceil\), which is equivalent to \(\frac{n+k-1}{k}\) when using integer arithmetic.

This problem will test your ability to perform simple arithmetic operations and implement ceiling division in an efficient manner.

inputFormat

The first line contains an integer \(T\) denoting the number of test cases. Each of the following \(T\) lines contains two space-separated integers \(n\) and \(k\), where \(n\) is the number of units to be transported and \(k\) is the maximum capacity per trip.

outputFormat

For each test case, output a single line denoting the minimum number of trips required.

4
10 3
15 5
9 9
1000000000 1

4
3
1
1000000000