Pagini recente » Cod sursa (job #2668363) | Clasamentul arhivei de probleme | Cod sursa (job #2793901) | monthly-2014/runda-2/clasament | Cod sursa (job #2086915)
#include <bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int nrc,n,m,a[100000][100000],s[100000];
void dfs(int nod)
{
for(int i=1;i<=n;i++)
if(a[nod][i]==1&&s[i]==0)
{
s[i]=nrc;
dfs(i);
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
f>>x>>y;
a[x][y]=1;
a[y][x]=1;
}
for(int i=1;i<=n;i++)
if(s[i]==0)
{
nrc++;
dfs(i);
}
g<<nrc;
return 0;
}