← All problemsSign in

Chefland

Chefland Chef wants to travel the entire country chefland. Chefland is made of N cities numbered from 0 to N-1. The chef can travel to all cities which are connected by roads. He starts his journey from city 0. Not all cities are connected to each other, to travel from one city to another, is free, whether they are connected directly or indirectly. But if 2 cities are not connected directly or

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