Pagini recente » Borderou de evaluare (job #2263283) | Cod sursa (job #2501676)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector<int> gr[100041];
bool vi[100041];
void dfs(int a){
vi[a] = 1;
for(auto b : gr[a]){
if(!vi[b]){
dfs(b);
}
}
}
int main(){
int n, m;
fin >> n >> m;
for(int i = 0; i < m; ++i){
int a, b;fin >> a >> b;
gr[a].push_back(b);
gr[b].push_back(a);
}
int s = 0;
for(int i = 1; i <= n; i++){
if(!vi[i]){
dfs(i);
s++;
}
}
fout << s;
return 0;
}