Streets Of VSSUT

CodeChefOpen on judge ↗

There are N departments and M roads in VSSUT, Burla. Each road has an ID associated with it. You are to process the following queries:- In the ith query you are given two numbers ui and vi . Find the number of distinct IDs that satisfy the following condition: the roads of that ID connect vertex ui and vi either directly or indirectly. Input The first line of the input contains two space-separa

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