Pagini recente » Cod sursa (job #611655) | Cod sursa (job #3004585) | Cod sursa (job #1807690) | Cod sursa (job #2719922) | Cod sursa (job #1650958)
#include <fstream>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
long long a[1001][1001],i,x,y,n,m,viz[1001],nr;
void DF(long long x)
{viz[x]=1;
for(int i=1;i<=n;i++)
if(a[x][i]==1&&viz[i]==0)
DF(i);
}
int main()
{fin>>n>>m;
for(i=1;i<=m;i++)
{fin>>x>>y;
a[x][y]=a[y][x]=1;}
for(i=1;i<=n;i++)
{if(viz[i]==0)
{DF(i);
nr++;
}
}
fout<<nr;
return 0;
}