Pagini recente » Cod sursa (job #1722795) | Cod sursa (job #995873) | Cod sursa (job #907934) | Cod sursa (job #2429741) | Cod sursa (job #185782)
Cod sursa(job #185782)
#include <stdio.h>
#include <stdlib.h>
#define N 100010
int *a[N],n,m;
int cati[N];
int vizitat[N];
void dfs(int x){
int i;
vizitat[x]=1;
for (i=1;i<=cati[x];++i)
if (!vizitat[a[x][i]])
dfs(a[x][i]);
}
int main(){
int x,y,i,r=0;
freopen("dfs.in","r",stdin);
freopen("dfs.out","w",stdout);
scanf("%d%d",&n,&m);
for (i=1;i<=m;++i){
scanf("%d%d",&x,&y);
++cati[x];
++cati[y];
}
fclose(stdin);
for (i=1;i<=n;++i){
a[i]=(int*)malloc(cati[i]+2);
cati[i]=0;
}
freopen("dfs.in","r",stdin);
scanf("%d%d",&n,&m);
for (i=1;i<=m;++i){
scanf("%d%d",&x,&y);
++cati[x];
a[x][cati[x]]=y;
++cati[y];
a[y][cati[y]]=x;
}
for (i=1;i<=n;++i)
if (!vizitat[i]){
dfs(i);
++r;
}
printf("%d\n",r);
return 0;
}