Pagini recente » Cod sursa (job #1642586) | Cod sursa (job #790393) | Cod sursa (job #156477) | Cod sursa (job #1890297) | Cod sursa (job #2314194)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,m,viz[100005];
vector <int> G[100005];
int ct;
void Read()
{ int x,y;
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
}
void DFS(int x)
{
viz[x]=1;
for(int i=0;i<G[x].size();i++)
if(!viz[G[x][i]]) DFS(G[x][i]);
}
void Solve()
{
for(int i=1;i<=n;i++)
if(!viz[i])
{
DFS(i); ct++;
}
fout<<ct;
}
int main()
{ Read();
Solve();
return 0;
}