Pagini recente » Cod sursa (job #1111315) | Cod sursa (job #1362009) | Cod sursa (job #3272651) | Cod sursa (job #590376) | Cod sursa (job #1800823)
#include <fstream>
#include <vector>
#include <iostream>
#define NM 100003
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n, m, use[NM], sol, v0[NM];
vector < int > v[NM];
void DFS(int nod)
{
use[nod] = 1;
for(int i = 0; i < v0[nod]; ++i)
{
if(!use[ v[ nod ][ i ] ]) DFS(v[ nod ][ i ]);
}
}
int main()
{
int x, y;
f >> n >> m;
for(int i = 1; i <= m; ++i)
{
f >> x >> y;
v0[x]++;
v0[y]++;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i = 1; i <= n; ++i)
if(!use[i]) sol++, DFS(i);
g << sol << '\n';
}