Minimum and Maximum

CodeChefOpen on judge ↗

There is a wall on the back of chefs house. The wall is divided into $3$ segments and Chef wants to paint these segments. Chef has $3$ types of colors $A$, $B$, $C$ and $x$, $y$, $z$ are the number of colors of each type respectively .He paints the first segment with color of type $A$ , second segment with color of type $B$ and third with type $C$. Chef's enemy John wants to trouble Chef so h

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