← All problemsSign in

Replace with Difference

CSESAdditional Problems IIOpen on judge ↗

You are given an array of n integers. You will perform n-1 operations on the array. In one operation, you will choose two numbers a and b from the array, delete both of them from the array and add |a - b| into the array. Your task is to find a sequence of operations such that the last number remaining in the array is 0. Input The first line has an integer n: the length of the array. The next

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

Sign in to chat with the tutor and save your progress.

Sign in to start