Pagini recente » Cod sursa (job #472097) | Istoria paginii runda/ceau_oni2017_2 | Cod sursa (job #2914555) | Cod sursa (job #123396) | Cod sursa (job #2661775)
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
int n,m,a,b;
vector<int> graf[100100];
bool viz[100005] = {0};
void dfs(int x)
{
viz[x] = 1;
for(auto it:graf[x])
if(!viz[it])
dfs(it);
}
int main()
{
int c = 0;
in>>n>>m;
for(int i=0;i<m;i++){
in>>a>>b;
graf[a].emplace_back(b);
graf[b].emplace_back(a);
}
for(int i=1;i<=n;i++)
if(!viz[i]){
dfs(i);
c++;
}
out<<c;
return 0;
}