Pagini recente » Cod sursa (job #2575274) | Cod sursa (job #2721032) | Cod sursa (job #2933634) | Cod sursa (job #2350747) | Cod sursa (job #1044624)
#include <stdio.h>
#include <iostream>
#include <cstring>
using namespace std;
struct graf
{
int node;
graf *link;
graf(int node,graf *link)
{
this->node=node;
this->link=link;
}
}*g[100001];
int use[100001];
void add(graf *&g,int y)
{
graf *p=new graf(y,g);
g=p;
}
void dfs(int at)
{
use[at]=1;
while(g[at])
{
if(!use[g[at]->node]) dfs(g[at]->node);
g[at]=g[at]->link;
}
}
int main()
{
freopen("dfs.in","r",stdin);
freopen("dfs.out","w",stdout);
int N,M,x,y;
scanf("%d%d",&N,&M);
for(int i=1;i<=M;++i)
{
scanf("%d%d",&x,&y);
add(g[x],y);
add(g[y],x);
}
memset(use,0,sizeof(use));
int cnt=0;
for(int i=1;i<=N;++i)
if(!use[i]) ++cnt, dfs(i);
printf("%d\n",cnt);
return 0;
}