Pagini recente » Cod sursa (job #515225) | Cod sursa (job #857547) | Cod sursa (job #1950853) | Cod sursa (job #2053014) | Cod sursa (job #2570007)
#include <iostream>
#include <fstream>
#include <vector>
#define NMAX 100000
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n, m, sol;
bool viz[NMAX+10];
vector <int> nod[NMAX+10];
void dfs(int x)
{ viz[x] = 1;
for(int i=0; i<nod[x].size(); i++)
if(!viz[nod[x][i]]) dfs(nod[x][i]);
}
int main()
{
f >> n >> m;
for(int i=1; i<=m; i++)
{ int nod1, nod2;
f >> nod1 >> nod2;
nod[nod1].push_back(nod2);
nod[nod2].push_back(nod1);
}
for(int i=1; i<=n; i++)
if(!viz[i]) dfs(i), sol++;
g << sol << '\n';
return 0;
}