Pagini recente » Cod sursa (job #1848773) | Cod sursa (job #1377336) | Cod sursa (job #1676389) | Cod sursa (job #2117460) | Cod sursa (job #2111541)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
vector <int> v[100005];
int n,m;
int a,b,cnt;
int viz[100005];
void dfs(int nod)
{
viz[nod]=1;
for(auto i :v[nod])
if(!viz[i])
dfs(i);
}
int main()
{
in>>n>>m;
for(int i=1;i<=m;++i)
{
in>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
for(int i=1;i<=n;++i)
if(!viz[i])
{
dfs(i);
++cnt;
}
out<<cnt;
return 0;
}