Pagini recente » Cod sursa (job #3317184) | Cod sursa (job #671080) | Cod sursa (job #2211521) | Cod sursa (job #1822107) | Cod sursa (job #1802343)
#include <fstream>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,m,p,nrc;
bool a[1001][1001],v[100001];
void adancime(int k)
{
int i;
v[k]=1;
for(i=1;i<=n;i++)
if(a[k][i]==1 && v[i]==0)
adancime(i);
}
int main()
{
fin>>n>>m;
int i,x1,x2;
for(i=1;i<=n;i++)
{
fin>>x1>>x2;
a[x1][x2]=a[x2][x1]=1;
}
for(i=1;i<=n;i++)
{
if(v[i]==0){
adancime(i);
nrc++;
}
}
fout<<nrc;
return 0;
}