Pagini recente » Cod sursa (job #1382445) | Monitorul de evaluare | Cod sursa (job #401543) | Cod sursa (job #667050) | Cod sursa (job #2221240)
#include <fstream>
#include <vector>
std::ifstream cin("dfs.in");
std::ofstream cout("dfs.out");
#define maxn 100010
typedef std::vector<int>::iterator iter;
std::vector <int> g[maxn];
int viz[maxn]={0},n,m;
void dfs(int x){
viz[x]=1;
for(iter it=g[x].begin();it!=g[x].end();it++)
if(!viz[*it])
dfs(*it);
}
int main()
{
int x,y,ans=0;
cin>>n>>m;
while(cin>>x>>y)
g[x].push_back(y);
for(int i=1;i<=n;i++)
if(!viz[i]){
dfs(i);
ans++;
}
cout<<ans;
return 0;
}