Make Arithmetic Progression
You are given three positive integers $X, Y, $ and $Z$. In one operation, you can choose any one of these values, and change it to *any* integer of your choice. Find the **minimum** number of operations required to make the sequence $(X, Y, Z)$ an arithmetic progression. Note that $(X, Y, Z)$ is an arithmetic progression if and only if $Y-X = Z-Y$. ### Input - The first line of input contain
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.
Sign in to chat with the tutor and save your progress.
Sign in to start