Pagini recente » Cod sursa (job #3320610) | Cod sursa (job #1011435) | Cod sursa (job #2207063) | Cod sursa (job #3337532) | Cod sursa (job #3306892)
#include <bits/stdc++.h>
using namespace std;
bool viz[100005];
vector<vector<int>> v[100005];
int cnt;
void dfs(int nod)
{
viz[nod]=true;
while(auto it:v[nod])
if(viz[it]==false)
dfs(it);
}
int main()
{
int n,m,a,b;
cin>>n>>m;
for(int i=1;i<=m;i++)
{
cin>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
for(int i=1;i<=n;i++)
if(viz[i]==false)
{
cnt++;
dfs(i);
}
cout<<cnt;
return 0;
}