Pagini recente » Cod sursa (job #1827797) | Cod sursa (job #322309) | Cod sursa (job #2295916) | Cod sursa (job #1959436) | Cod sursa (job #2206276)
#include <cstdio>
#include <vector>
using namespace std;
vector <int> L[100001];
int f[100001];
void dfs(int i)
{
f[i]=1;
for(int it=0; it<L[i].size(); it++)
if(!f[L[i][it]])
dfs(L[i][it]);
}
int main()
{
int n,m,rez,i,x,y;
freopen("dfs.in","r",stdin);
freopen("dfs.out","w",stdout);
scanf("%d%d",&n,&m);
while(m--)
{
scanf("%d%d",&x,&y);
L[x].push_back(y);
L[y].push_back(x);
}
rez=0;
for(i=1; i<=n; i++)
if(!f[i])
{
rez++;
dfs(i);
}
printf("%d",rez);
return 0;
}