Tour

CodeChefOpen on judge ↗

Mayank is fond of traveling, so he decides to choose two cities A and B for a tour. Later on, he changed his mind and want to travel as much as possible but starting from A and ending at B. He does not want to travel any city twice. So he is unable to find such a path between A and B so he is asking for help from you. You are given N cities and M paths between them. You need to find and print the

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