Pagini recente » Istoria paginii runda/concurs7_1/clasament | Istoria paginii runda/mereuafectatemotional | Istoria paginii runda/lol_contest_round_01 | Cod sursa (job #2667746) | Cod sursa (job #2870469)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector<int>A[100005];
int viz[100005],n,m,nr=0;
void dfs(int n)
{
for(auto u:A[n])
if(!viz[u])
{
viz[u]=1;
dfs(u);
}
}
int main()
{
fin>>n>>m;
for(int i=1; i<=m; i++)
{
int a,b;
fin>>a>>b;
A[a].push_back(b);
A[b].push_back(a);
}
for(int i=1; i<=n; i++)
{
if(!viz[i])
{
nr++;
dfs(i);
}
}
fout<<nr;
return 0;
}