Pagini recente » Cod sursa (job #1338438) | Cod sursa (job #2547712) | Cod sursa (job #981550) | Istoria paginii runda/pregatire_oji_2022 | Cod sursa (job #678367)
Cod sursa(job #678367)
#include<fstream>
#include<vector>
using namespace std;
#define nmax 100002
#define pb push_back
vector <int> lista[nmax];
int n,m,a,b;
bool v[nmax];
void dfs(int nod)
{
v[nod]=true;
for(unsigned int i=0;i<lista[nod].size();++i)
{
int nod2=lista[nod][i];
if(!v[nod2])
dfs(nod2);
}
}
int main()
{
ifstream f("dfs.in");
ofstream g("dfs.out");
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>a>>b;
lista[a].pb(b);
lista[b].pb(a);
}
int cont=0;
for(int i=1;i<=n;i++)
if(!v[i])
{
cont++;
dfs(i);
}
g<<cont;
}