Pagini recente » Cod sursa (job #3222454) | Cod sursa (job #621357) | Cod sursa (job #364012) | Cod sursa (job #1092101) | Cod sursa (job #2438218)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,x,y,a[100002][100002],nrc,viz[100002],i,j,m;
void comp(int x)
{
int i;
viz[x] = 1;
for(i = 1 ; i <= a[x][0]; ++i)
if(viz[a[x][i]] == 0)
comp(a[x][i]);
}
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;
}
for(i = 1 ; i <= n ; ++i)
if(viz[i] == 0){
nrc++;
comp(i);
}
g << nrc;
return 0;
}