Pagini recente » Cod sursa (job #1428670) | Cod sursa (job #129083) | Cod sursa (job #1742316) | Cod sursa (job #2745530) | Cod sursa (job #1188293)
#include <cstdio>
using namespace std;
int i,j,m,n,x,y,a[1000][1000],nr;
bool ok[1000000];
void dfs(int x)
{
int i;
ok[x]=true;
for(i=1; i<=n; i++)
{
if(a[x][i]==1 && ok[i]==false) dfs(i);
}
}
int main()
{
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);
a[x][y]++;
a[y][x]++;
}
for(i=1; i<=n; i++)
{
if(ok[i]==false) {dfs(i);nr++;}
}
printf("%d\n",nr);
return 0;
}