MANISH ALGO

CodeChefOpen on judge ↗

Manish, a WANNABE competitive programmer is learning graph theory. He just learnt some algorithms to find the shortest path between pairs of vertices in a simple weighted undirected graph. Intrigued by those algorithms, Manish developed an algorithm of his own to find the shortest path between pairs of vertices in a graph and called it $MANISH$ $ALGO$. You need to test the correctness of $MANISH$

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