Roads in Shinjuku

CodeChefOpen on judge ↗

The government of Britannia wants to know some statistics about the city of Shinjuku. They wanted to count the number of unordered pairs of intersections S and T in the city such that there are at least two edge disjoint paths between them. Input First line of the test case contains N and M the number of intersections in Shinjuku and the total number of connections. The next M lines contain t

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