← All problemsSign in

Button

The vindicators have returned and posed a threat to Rick and trapped him there is only one way to escape , Help him finding a way out. There are an integer sequence $A1,...,AN$ consisting of $N$ terms, and $N$ buttons. When the $i-th$ $(1≦i≦N)$ button is pressed, the values of the $i$ terms from the first through the $i-th$ are all incremented by $1$. There is also another integer sequence $B1

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