Pagini recente » Istoria paginii runda/concurss | Cod sursa (job #196261) | Istoria paginii runda/ada22/clasament | Istoria paginii runda/marte20 | Cod sursa (job #1248897)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
vector< vector<int> > a;
vector<bool>v;
int n;
void dfs(int x)
{
for(vector<int>::iterator i=a[x].begin();i!=a[x].end();++i)
if(v[*i]==false)
{
v[*i]=true;
dfs(*i);
}
}
int main()
{
int i,c=0,x,y,m;
cin>>n>>m;
a=vector< vector<int> >(n+1);
v=vector<bool>(n+1);
for(;m;m--)
{
cin>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
for(i=1;i<=n;i++)
if(v[i]==false)
{
v[i]=true;
dfs(i);
c++;
}
cout<<c;
return 0;
}