Pagini recente » Cod sursa (job #1467438) | Cod sursa (job #1264967) | Istoria paginii runda/cei_mici3/clasament | Cod sursa (job #130352) | Cod sursa (job #1588005)
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int nrc,i,n,m,x,y,v[100000],a[100000][40];
void dfs(int x)
{int j;
v[x]=nrc;
for(j=1;j<=a[x][0];++j)
if(v[a[x][j]]==0)
dfs(a[x][j]);
}
int main()
{ f>>n>>m;
for(i=1;i<=m;++i)
{ f>>x>>y;
++a[x][0];
a[x][a[x][0]]=y;
++a[y][0];
a[y][a[y][0]]=x;
}
nrc=0;
for(i=1;i<=n;++i)
if(v[i]==0)
{++nrc;
dfs(i);
}
g<<nrc;
return 0;
}