← All problemsSign in

All Even

CodeChefRating 617Open on judge ↗

There are $N$ numbers written on a blackboard. These $N$ values are denoted $A_1, A_2, \ldots, A_N$ from left to right. You can modify the blackboard using the following three-step procedure, as long as $N \ge 2$: - First, add $A_N$ to $A_{N-1}$. - Then, erase $A_N$ from the blackboard. - Finally, reduce $N$ by $1$. In simpler words, you can add the last value to the second-last value; then er

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