Ayush, Gaurav and Astrologer

CodeChefOpen on judge ↗

Problem Description Ayush and Gaurav are best friends. Both of them are travelling to a strange city called Algorithmia. During their travel, both of them gets separated. In Algorithmia there are n locations and m directed paths of unit length between these locations Now Ayush wants to search Gaurav, so he goes to meet the astrologer in the city. Astrologer told him the location of Gaurav but he

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