Pagini recente » Cod sursa (job #2234258) | Cod sursa (job #1352052) | Istoria paginii autumn-warmup-2007/clasament/runda-2 | Cod sursa (job #2638898) | Cod sursa (job #2124849)
#include <iostream>
#include <vector>
#include <fstream>
#define limit 100001
using namespace std;
vector <int > v[limit];
bool viz[limit];
int m, n, conexe=0;
void dfs(int x)
{
viz[x]=1;
for (int i = 0; i < int(v[x].size()); i++)
if (!viz[v[x][i]])
dfs(v[x][i]);
}
int main()
{
ifstream fin ("dfs.in");
ofstream fout ("dfs.out");
fin>>n >>m;
for (int i = 1; i <= m; i++)
{
int x, y;
fin>>x >>y;
v[x].push_back(y);
v[y].push_back(x);
}
for (int i = 1; i <= n; i++)
if (!viz[i])
{
conexe++;
dfs(i);
}
fout<<conexe;
return 0;
}