Cod sursa(job #2050886)
Utilizator | Data | 28 octombrie 2017 11:49:07 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,k,s,i,x,v,y,a[100000];
int main()
{
f>>n>>k;
s=n;
for(i=1;i<=k;i++)
{
f>>x>>y;
if(a[x]==0 && a[y]==0)
{
s--;
a[x]++;
a[y]++;
}
else
if(a[x]==0)
a[x]++;
else
if(a[y]==0)
a[y]++;
}
for(i=1;i<=n;i++)
if(a[i]==0)
s--;
g<<n-s;
return 0;
}