XPress Capital

CodeChefOpen on judge ↗

There are *N* cities and *M* roads in XPressland. Each road connects a pair of cities. The roads in XPressland are one-way. What is the minimum number of new roads that need to be built to make all the cities reachable from the capital? New roads will also be one-way. ### Input The first line of input consists of three integers *N*, *M* and *S* — the number of cities, the number of roads and th

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