Minimum Water Stations

During a marathon, water stations must be placed along the route so that the distance between any two consecutive stations does not exceed a specified maximum distance d kilometers. Given the total length n of the route, your task is to determine the minimum number of water stations needed to cover the entire route.

The number of water stations can be computed using the formula: \( \left\lceil \frac{n}{d} \right\rceil = \frac{n + d - 1}{d} \). Implement a program that reads the values of n and d from standard input and prints the minimum number of stations required.

inputFormat

The input consists of a single line containing two space-separated integers: n and d. Here, n represents the total length of the marathon route in kilometers, and d is the maximum allowed distance in kilometers between consecutive water stations.

outputFormat

Output a single integer, which is the minimum number of water stations required.

12 3

4