Pagini recente » Cod sursa (job #1991742) | Cod sursa (job #1240255) | Cod sursa (job #1798960) | Cod sursa (job #370539) | Cod sursa (job #2616541)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int n,m,x,y;
vector <int> g[100001];
int viz[100001];
void dfs (int node){
viz[node]=1;
for (int i=0; i<g[node].size(); i++){
if (!viz[g[node][i]]){
dfs(g[node][i]);
}
}
}
int main()
{
ifstream cin("dfs.in");
ofstream cout("dfs.out");
ios_base::sync_with_stdio(false);
cin.tie(0);
//read
cin>>n>>m;
for (int i=0; i<m; i++){
cin>>x>>y;
g[x].push_back(y);
g[y].push_back(x);
}
int res=0;
for (int i=1; i<=n; i++){
if (!viz[i]){
dfs(i);
res++;
}
}
cout<<res;
return 0;
}