Pagini recente » Cod sursa (job #179835) | Cod sursa (job #2890408) | Cod sursa (job #229473) | Cod sursa (job #851110) | Cod sursa (job #276352)
Cod sursa(job #276352)
#include<fstream.h>
int a[120][120],s[120],n,nr=0;
void df( int nod)
{ int i;
s[nod]=1;
for(i=1;i<=n;i++)
if(a[nod][i]==1 && s[i]==0)
{
df(i);
}
}
int main()
{ int i,j,k,m;
ifstream f("dfs.in");
f>>n>>m;
for(k=1;k<=m;k++)
{ f>>i>>j;
a[i][j]=a[j][i]=1;
}
nr=0;
for(i=1;i<=n;i++)
if(s[i]==0){nr+=1;
df(i);
}
ofstream g("dfs.out");
g<<nr;
return 0;
}