Course Schedule

CSESGraph AlgorithmsOpen on judge ↗

You have to complete n courses. There are m requirements of the form "course a has to be completed before course b". Your task is to find an order in which you can complete the courses. Input The first input line has two integers n and m: the number of courses and requirements. The courses are numbered 1,2,\dots,n. After this, there are m lines describing the requirements. Each line has two int

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