Pagini recente » Istoria paginii runda/ojiiiii/clasament | Cod sursa (job #2537815) | Istoria paginii runda/winners18 | Cod sursa (job #2537026) | Cod sursa (job #2838363)
#include<fstream>
#include<vector>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
vector <int> g[100000];
int x,y,n,m,viz[100001],sol;
void dfs(int nod)
{
viz[nod]=1;
for(int i=0;i<g[nod].size();i++)
if(viz[g[nod][i]]==0)
dfs(g[nod][i]);
}
int main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
cin>>x>>y;
g[x].push_back(y);
g[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(viz[i]==0)
{
sol++;
dfs(i);
}
cout<<sol;
return 0;
}