The optimal sequence of operations is adding k−1 1-s into the set each time, at the same time decreasing n by k−1. This implies that the answer is ⌈n−1⌉/⌈k−1⌉.

CF1988A solution。没理解这句话，求问 adding k-1 1-s into the set each time 是什么意思。