3out1in

CodeChefRating 2065Open on judge ↗

*This problem has subtasks.* Given an array $B$ containing $M$ (where $M$ is odd) integers, you have to perform the following operation on $B$ until it consists of only a single element. * Choose **distinct** indices $i,$ $j,$ $k$ of the array $B$. * Remove $B_i, B_j, B_k$ from the array. * Append $(B_i + B_j - B_k)$ to $B$. Note that the operation reduces the length of $B$ by $2$. For exampl

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