Pagini recente » Cod sursa (job #2642023) | Cod sursa (job #1578157) | Cod sursa (job #2933657) | Cod sursa (job #625917) | Cod sursa (job #2448293)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int N, M;
int vizat[100010];
std::vector<int> v[100010];
int nr = 0;
void dfs(int nod){
vizat[nod] = 1;
for(auto it : v[nod]){
if(!vizat[it]){
dfs(it);
}
}
}
int main(){
ifstream fin("dfs.in");
ofstream fout("dfs.out");
fin >> N >> M;
int x, y;
for(int i = 1; i <= M; i++){
fin >> x >> y;
v[x].push_back(y);
}
for(int i = 1; i <= N; i++){
if(!vizat[i]){
nr++;
dfs(i);
}
}
fout << nr;
return 0;
}