Pagini recente » Cod sursa (job #2660853) | Cod sursa (job #2351841) | Cod sursa (job #1462133) | Cod sursa (job #2716218) | Cod sursa (job #1498615)
#include <iostream>
#include<fstream>
#include<vector>
#define maxn 100005
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
vector<int> v[maxn];
bool viz[maxn];
void dfs(int x)
{ int i;
for(i=0; i<v[x].size(); i++)
if(!viz[v[x][i]])
{ viz[v[x][i]]=1;
dfs(v[x][i]); }
}
int main()
{ int n,m,i, x, y, nr=1;
in>>n>>m;
for(i=1; i<=m; i++)
{ in>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
dfs(1);
for(i=1; i<=n; i++)
if(!viz[i]) nr++, viz[i]=1, dfs(i);
out<<nr;
return 0;
}