YEH RAASTE

CodeChefOpen on judge ↗

Aman a college student is on his vacation and want to visit a place $D$ but before visiting $D$ he must have to visit $B$ and then $C$ and only after visiting $C$ he can visit $D$. There are $x$ routes for visiting $B$ , $y$ route for visiting $C$ from $B$ and $z$ route for visiting $D$ from $C$. so you have to find the maximum possible route for visiting place $D$ from the initial position.

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