Pagini recente » Cod sursa (job #2008661) | Cod sursa (job #296971) | Cod sursa (job #3208656) | Solutii preONI 2006, Runda a 4-a | Cod sursa (job #2715056)
#include <bits/stdc++.h>
#define N 100001
#define pb push_back
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,i,j,m,x,y,nr;
bool viz[N];
vector <int> v[N];
void dfs(int nod)
{
viz[nod]=1;
for(int i=0; i<v[nod].size(); i++)
if(!viz[v[nod][i]])
dfs(v[nod][i]);
}
int main()
{
f>>n>>m;
for(i=1; i<=m; i++)
{
f>>x>>y;
v[x].pb(y);
v[y].pb(x);
}
for(i=1; i<=n; i++)
{
if(!viz[i])
{
nr++;
dfs(i);
}
}
g<<nr;
return 0;
}