Treasure Hunt

CodeChefOpen on judge ↗

You are an adventurer standing at the final treasure chest . The chest is locked by a passcode (hidden sequence), which is a list of integers. The Treasure Guardians want to justify if you are worthy by giving you another list of integers, of which each element in this list represents the $differences$ between two $consecutive$ integers of the $hidden$ sequence. Explanation: If we call the hidde

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