Pagini recente » Cod sursa (job #1001003) | Cod sursa (job #903529) | Cod sursa (job #902363) | Borderou de evaluare (job #1000998) | Cod sursa (job #902259)
Cod sursa(job #902259)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
long int n; int h=1;
vector <bool> a[100001],s;
void citire()
{
int x,y,m,i;
fin>>n>>m;
for(i=0;i<n;i++)
{
s.push_back(0);
for(int j=0;j<n;j++)
a[i].push_back(0);
}
for(i=0;i<m;i++) {fin>>x>>y; a[x][y]=1; a[y][x]=1;}
}
void dfs(int nod)
{
s[nod]=1;
for(int k=1;k<=n;k++)
if(a[nod][k]==1 && !s[k])
dfs(k);
}
int muchii()
{
for(int i=1;i<=n;i++) if(!s[i]) {h++; dfs(i);}
return h;
}
int main()
{
citire();
dfs(1);
fout<<muchii();
}