Distribute Candies

CodeChefOpen on judge ↗

Vidya has a box containing $N$ candies of different sweetness. She decided to distribute these candies among her three friends - 'ISH', 'OMI' and 'GOVI'. She opted a different strategy of distributing the candies. She picks three candies from the box randomly and distribute them in such a way that 'GOVI' gets the candy with minimum sweetness from the three picked candies. This process is repeated

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