Pagini recente » Cod sursa (job #1374677) | Cod sursa (job #3328579) | Cod sursa (job #1831629) | Borderou de evaluare (job #1512794) | Cod sursa (job #1801088)
#include <fstream>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int a[1601][1601],n,m;
bool v[100001];
void cit(){
int i,j,h;
fin>>n>>m;
for(h=1;h<=m;h++){
fin>>i>>j;
a[i][j]=a[j][i]=1;
}
fin.close();
}
void adanc(int k){
int i;
v[k]=true;
for(i=1;i<=n;i++)
if(v[i]==false&&a[k][i]==1)
adanc(i);
}
int main(){
cit();
int i,nr=0;
for(i=1;i<=n;i++)
if(v[i]==false){
nr++;
adanc(i);
}
fout<<nr;
fout.close();
return 0;
}