Pagini recente » Cod sursa (job #2566987) | Cod sursa (job #367723) | Cod sursa (job #1945303) | Cod sursa (job #2295319) | Cod sursa (job #307273)
Cod sursa(job #307273)
#include <stdio.h>
#define dim 10100
long long int el;
char a[dim][dim];
int n,m,i,k;
int viz[dim];
void read()
{
int x,y;
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
a[x][y]=a[y][x]=1;
}
}
void dfs(int nod)
{
viz[nod]=1;
for(int i=1;i<=n;i++)
if(!viz[i] && a[nod][i])
dfs(i);
}
int main ()
{
freopen("dfs.in","r",stdin);
freopen("dfs.out","w",stdout);
read();
for(i=1;i<=n;i++)
if(!viz[i])
dfs(i),el++;
printf("%d\n",el);
/* for(i=1;i<=n;i++,printf("\n"))
for(k=1;k<=n;k++)
printf("%d",a[i][k]);
*/
return 0;
}