Pagini recente » Diferente pentru problema/propozitie2 intre reviziile 17 si 5 | Rezultatele filtrării | Profil BlackNesta | Cod sursa (job #2094165)
#include<bits/stdc++.h>
using namespace std;
const int N=100020;
vector <int> d[N];
bool v[N];
void dfs(int nod){
v[nod]=1;
int l=d[nod].size();
for(int i=0;i<l;i++)if(!v[d[nod][i]]){
dfs(d[nod][i]);
}
}
int main(){
int n, m;
ifstream f("dfs.in");
ofstream g("dfs.out");
f>>n>>m;
for(int i=1;i<=m;i++){
int x, y;
f>>x>>y;
d[x].push_back(y);
d[y].push_back(x);
}
int k=0;
for(int i=1;i<=n;i++)if(!v[i]){
k++;
dfs(i);
}
g<<k;
return 0;
}