Cod sursa(job #1301020)
Utilizator | Data | 25 decembrie 2014 14:54:50 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("dfs.in");
ofstream g("dfs.out");
long d=0,n,m,t[100001],i,x,y;
f>>n>>m;
for(i=1;i<=n;i++)
t[i]=i;
for(i=1;i<=m;i++)
{
f>>x>>y;
if(t[x]>t[y])
t[x]=t[y];
else t[y]=t[x];
}
for(i=1;i<=n;i++)
if(t[i]!=i)
d++;
g<<n-d;
f.close();
g.close();
return 0;
}