← All problemsSign in

Flight Routes Check

CSESGraph AlgorithmsOpen on judge ↗

There are n cities and m flight connections. Your task is to check if you can travel from any city to any other city using the available flights. Input The first input line has two integers n and m: the number of cities and flights. The cities are numbered 1,2,\dots,n. After this, there are m lines describing the flights. Each line has two integers a and b: there is a flight from city a to city

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

Sign in to chat with the tutor and save your progress.

Sign in to start