Fairy Tales!!

CodeChefOpen on judge ↗

Red Riding Hood wants to meet her Grandma. In order to reach her Grandma’s house, she needs to collect fruits from all the magical trees in the magical forest. All the magical trees are connected to each other by pavements. Red Riding Hood can travel only on pavements in order to reach all the magical trees. Precisely, there are $N$ magical trees connected by $M$ distinct pavements. _Note- E

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