Pagini recente » Cod sursa (job #1315484) | Cod sursa (job #1260713) | Cod sursa (job #222133) | Cod sursa (job #2138552) | Cod sursa (job #2614919)
#include <bits/stdc++.h>
#define Nmax 100005
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector<int> v[Nmax] ;
int vizitat[Nmax] ;
void extindere( int nod )
{
int i ;
vizitat[nod] = 1 ;
for ( auto i : v[nod] )
extindere[i] ;
}
int main()
{
int n , m , i , cont = 0 , x , y;
fin >> n >> m ;
for ( int i = 1 ; i <= m ; i++ )
{
fin >> x >> y ;
v[x].push_back(y) ;
}
for(int i = 1 ; i <= n ; i++ ) vizitat[i] = 0 ;
for ( int i = 1 ; i <= m ; i++ )
{
if ( vizitat[i] == 0 )
{
extindere(i) ;
cont++ ;
}
}
fout << cont ;
return 0;
}