Maximum Teams Formation

You are given a total of N participants and a team size K. Your task is to determine the maximum number of teams that can be formed such that each team consists of exactly K participants. If K = 0, output 0 as no team can be formed.

The number of teams is given by the formula: $$\lfloor \frac{N}{K} \rfloor$$ when \(K > 0\).

inputFormat

The input is read from standard input (stdin) and consists of two space-separated integers:

• N: the total number of participants.
• K: the size of each team.

outputFormat

Output a single integer on standard output (stdout) representing the maximum number of teams that can be formed.

15 5

3