← All problemsSign in

Salesman Motu

Motu chose a job of Travelling Salesman. He wished to visit $N$ cities connected by $M$ unidirectional roads. But he has not enough money to visit. Patlu gave him opportunity that if he chooses a city such that he can come back there after visiting atleast $K$ cities(inculding the staring city ) and no city visited $twice$ ( except starting city ) then he will pay all his money. If that is possib

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