Pagini recente » Cod sursa (job #1339978) | Cod sursa (job #1133864) | Cod sursa (job #700025) | Cod sursa (job #1463375) | Cod sursa (job #3334180)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
vector<int> vecini[100005];
int viz[100005];
int n,m;
void dfs(int x)
{
viz[x]=1;
for(auto y: vecini[x])
{
if(!viz[y])
{
dfs(y);
}
}
}
int main ()
{
ifstream f("dfs.in");
ofstream g("dfs.out");
int x,y;
f>>n>>m;
for(int i=1; i<=m; i++)
{
f>>x>>y;
vecini[x].push_back(y);
vecini[y].push_back(x);
}
int rez=0;
for(int i=1; i<=n; i++)
{
if(!viz[i])
{
rez++;
dfs(i);
}
}
g<<rez;
return 0;
}