Pagini recente » Cod sursa (job #1843239) | Cod sursa (job #2380768) | Cod sursa (job #3290279) | Cod sursa (job #432073) | Cod sursa (job #2263325)
#include<bits/stdc++.h>
using namespace std;
const int N=100020;
vector <int> mda[N];
bool v[N];
void dfs(int nod){
v[nod]=1;
int l=mda[nod].size();
for(int i=0;i<l;i++)if(!v[mda[nod][i]]){
dfs(mda[nod][i]);
}
}
int main(){
ifstream f("dfs.in");
ofstream g("dfs.out");
int n, m, x, y, k=0;
f>>n>>m;
while(m--){
f>>x>>y;
mda[x].push_back(y);
mda[y].push_back(x);
}
for(int i=1;i<=n;i++) if(!v[i]){
k++;
dfs(i);
}
g<<k;
}