Pagini recente » Cod sursa (job #2579041) | Cod sursa (job #1956012) | Cod sursa (job #2166282) | Cod sursa (job #2240415) | Cod sursa (job #2792797)
#include <fstream>
#include <vector>
using namespace std;
#define NMAX 100000
#define MMAX 200000
vector<int> v[NMAX + 1];
int f[NMAX + 1];
void DFS( int node ) {
f[node] = 1;
for ( auto copil : v[node] ) {
if ( f[copil] == 0 ) {
DFS(copil);
}
}
}
ifstream cin ("dfs.in");
ofstream cout ("dfs.out");
int main() {
int n, m, i, x, y, cnt;
cin >> n >> m;
for ( i = 0; i < m; i++ ) {
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
cnt = 0;
for ( i = 1; i <= n; i++ ) {
if ( f[i] == 0 ) {
DFS(i);
cnt++;
}
}
cout << cnt << "\n";
return 0;
}