Score : $300$ points
There is a sequence of length $N$: $A_1, A_2, ..., A_N$. Initially, this sequence is a permutation of $1, 2, ..., N$.
On this sequence, Snuke can perform the following operation:
Snuke would like to make all the elements in this sequence equal by repeating the operation above some number of times. Find the minimum number of operations required. It can be proved that, Under the constraints of this problem, this objective is always achievable.
Input is given from Standard Input in the following format:
$N$ $K$ $A_1$ $A_2$ $...$ $A_N$
Print the minimum number of operations required.
4 3 2 3 1 4
2
One optimal strategy is as follows:
In the first operation, choose the first, second and third elements. The sequence $A$ becomes $1, 1, 1, 4$.
In the second operation, choose the second, third and fourth elements. The sequence $A$ becomes $1, 1, 1, 1$.
3 3 1 2 3
1
8 3 7 3 1 8 4 6 2 5
4