Pagini recente » Cod sursa (job #2278098) | Rating Diaconu (daria_diaconu) | Monitorul de evaluare | Cod sursa (job #2028548) | Cod sursa (job #389869)
Cod sursa(job #389869)
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
#define foreach(v) for(typeof (v).begin() it=(v).begin();it!=(v).end();it++)
vector <int> G[100000];
int nrc,viz[100000],m,n;
void dfs(int nod)
{ viz[nod]=1;
foreach(G[nod])
if(viz[*it]==0)
dfs(*it);
}
void citire()
{int i,x,y;
ifstream fin("dfs.in");
fin>>n>>m;
for(i=1;i<=m;i++)
{cin>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
fin.close();
}
int main()
{int i,x,y;
ifstream fin("dfs.in");
fin>>n>>m;
for(i=1;i<=m;i++)
{fin>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
fin.close();
for(i=1;i<=n;i++)
if(viz[i]==0)
{dfs(i);
nrc++;}
cout<<nrc;
return 0;
}