Minimum Trucks Required

You are given the number of delivery zones n and the maximum number of zones one truck can cover in a single trip k. Your task is to compute the minimum number of trucks required to cover all zones.

The answer is given by the ceiling of \(\frac{n}{k}\), i.e., \(\lceil{n/k}\rceil\). For example, if there are 6 zones and each truck can cover 2 zones, then 3 trucks are required, because \(\lceil6/2\rceil = 3\).

inputFormat

The input consists of a single line containing two space-separated integers n (the number of delivery zones) and k (the maximum zones a truck can cover in one trip).

outputFormat

Output a single integer representing the minimum number of trucks required.

6 2

3