Balloon Problem

CodeChefOpen on judge ↗

There is a box with $N$ balloons in it. The integer $a[i ]$ is written on the i-th balloon. Shinchan can perform the following operation as many times as he wants: - Take out two balloon from the box. Then, return them to the box along with a new balloon, on which the absolute difference of the integers written on the two balloon is written. Determine whether it is possible for Shinchan to reach

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