Pagini recente » Cod sursa (job #294088) | Cod sursa (job #1228632) | Cod sursa (job #2495293) | Cod sursa (job #2948440) | Cod sursa (job #2732175)
#include <bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,s,x,y;
vector<int> v[100005];
bool viz[100005];
int nr;
void dfs(int nod)
{
viz[nod]=1;
for (auto it:v[nod])
if (viz[it]==0)
dfs(it);
}
int main()
{
f>>n>>m;
for (int i=1; i<=m; i++)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for (int i=1;i<=n;i++)
if (viz[i]==0)
nr++,dfs(i);
g<<nr;
return 0;
}