SP21068 TPCPPLAR - Popular

[English](/problems/TPCPPLAR/en/) [Vietnamese](/problems/TPCPPLAR/vn/)Given a directed graph G , N vertices and M arcs. A node X called "acessible" to Y if there is a path from X to Y A node X called "popular" if every node Y in V fulfill one of two conditions : 1\. X is acessible to Y 2\. Y is acessible to X The Problem : Given graph G, count the number of popular node. Input \- The first line contain N and M, the number of nodes and arcs (1

N/A

N/A