Reachable Nodes

CSESAdvanced TechniquesOpen on judge ↗

A directed acyclic graph consists of n nodes and m edges. The nodes are numbered 1,2,\dots,n. Calculate for each node the number of nodes you can reach from that node (including the node itself). Input The first input line has two integers n and m: the number of nodes and edges. Then there are m lines describing the edges. Each line has two distinct integers a and b: there is an edge from node

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