← All problemsSign in

Split Stones

There are three piles of stones. The first pile contains $a$ stones, the second pile contains $b$ stones and the third pile contains $c$ stones. You must choose one of the piles and split the stones from it to the other two piles; specifically, if the chosen pile initially contained $s$ stones, you should choose an integer $k$ ($0 \le k \le s$), move $k$ stones from the chosen pile onto one of the

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