Pagini recente » Cod sursa (job #3268470) | Cod sursa (job #939242) | Cod sursa (job #643322) | Cod sursa (job #2507804) | Cod sursa (job #1498622)
#include <iostream>
#include<fstream>
#include<vector>
#define maxn 200000
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
vector<int> v[maxn];
bool viz[maxn];
void dfs(int x)
{ int i;
viz[x]=1;
for(i=0; i<v[x].size(); i++)
if(!viz[v[x][i]])
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++;
dfs(i); }
out<<nr;
return 0;
}