K-Closeness

CodeChefRating 1558Open on judge ↗

You are given an array $A$ of length $N$, and an integer $K$. You can perform the following operation: - Choose any index $i$ ($1 \leq i \leq N$), and increase $A_i$ by $K$. Find the **minimum** possible value of $\max(A) - \min(A)$ attainable, if you can perform this operation as many times as you like (possibly, zero times). ### Input - The first line of input will contain a single integer $

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI