Cod sursa(job #3147290)
Utilizator | Data | 25 august 2023 14:17:16 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
using namespace std;
int v[10001][10001],a[10001]={0};
int main()
{
int n,k,i,x,y,j,nr,m=0;
cin>>n>>k;
for(i=1;i<=k;i++){
cin>>x>>y;
v[x][y]=v[y][x]=1;
}
for(i=1;i<=n;i++){
nr=0 ;
for(j=1;j<=n;j++){
if(v[i][j]==1 && a[j]==0) {
nr++; a[j]=1;
v[i][j]=v[j][i]=0;
}
}
if(nr>0) m++;
if(a[i]==0 && nr==0) m++;
}
cout<<m;
}