Pagini recente » Cod sursa (job #1899982) | Cod sursa (job #1228027) | Cod sursa (job #2666045) | Istoria paginii runda/cerculdeinfo-lectia9-cuplaj_flux | Cod sursa (job #3248585)
#include <bits/stdc++.h>
using namespace std;
vector<int>a[1001];
int vizited[1001];
int c;
void dfs(int nod)
{
vizited[nod]=1;
for(auto i:a[nod])
{
if(!vizited[i])
dfs(i);
}
}
int main()
{
int n,i,x,y,m;
cin>>n>>m;
for(i=1;i<=m;i++)
{
cin>>x>>y;
a[x].push_back(y);
}
for(i=1;i<=n;i++)
{
if(!vizited[i])
{
dfs(i);
c++;
}
}
cout<<c;
return 0;
}