Pagini recente » Cod sursa (job #2133635) | Cod sursa (job #1629437) | Cod sursa (job #2127812) | Istoria paginii runda/ghhhh | Cod sursa (job #2667220)
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector<int> v[100105];
bool viz[100005];
int n, m;
void dfs(int x){
int i;
viz[x] = 1;
for(i=0; i<v[x].size(); i++)
if(!viz[v[x][i]])
dfs(v[x][i]);
}
int main(){
f>>n>>m;
int i, a, b, rez=0;
for(int i=0; i<m; i++){
f>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
for(int i=1; i<=n; i++)
if(!viz[i]){
dfs(i);
rez++;
}
g<<rez;
return 0;
}