Pagini recente » Cod sursa (job #355841) | Istoria paginii runda/cerculdeinfo-lectia2-arborideintervale/clasament | Cod sursa (job #2783025) | Istoria paginii runda/simulare_006/clasament | Cod sursa (job #1575488)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> L[100000];
#define pb push_back
int n,m,sel[100000],nr;
void load()
{
int i,x,y;
f>>n>>m;
for (i=1;i<=m;i++)
{
f>>x>>y;
L[x].pb(y);
L[y].pb(x);
}
}
void df(int x)
{
int j;
sel[x]=1;
for (j=0;j<L[x].size();j++)
{
if(sel[j]!=0)
{
df(L[x][j]);
}
}
}
int main()
{
load();
int i;
nr=0;
for (i=1;i<=n;i++)
{
if(sel[i]==0)
{
nr++;
df(i);
}
}
g<<nr;
return 0;
}