Pagini recente » Cod sursa (job #629032) | Cod sursa (job #3039259) | fmi-no-stress-9/solutii | Cod sursa (job #123860) | Cod sursa (job #1188275)
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream ff("dfs.out");
int g[1000][1000],i,j,m,n,y,z,nr;
bool del[1000000];
void df(int x)
{int i;
del[x]=true;
for (i=1;i<=n;i++)
if (g[x][i]==1&&!del[i])
df(i);
}
int main()
{f>>n;f>>m;
for (i=1;i<=m;i++)
{f>>y>>z;
g[y][z]=1;
g[z][y]=1;
}
nr=0;
for (i=1;i<=n;i++)
if (!del[i]) {df(i);
nr++;}
ff<<nr;
f.close();
ff.close();
return 0;
}