Pagini recente » Cod sursa (job #2109057) | Cod sursa (job #1005986) | Cod sursa (job #1361928) | Cod sursa (job #3336600) | Cod sursa (job #2144152)
#include <bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> gr;
bool a[100001];
void dfs(int u) {
a[u]=true;
int i;
for(i=0; i<gr[u].size(); i++) {
if(!a[gr[u][i]]) {
dfs(gr[u][i]);
}
}
}
int main() {
int n, m, cont=0;
f>>n>>m;
for (int i=1; i<=m; i++) {
int a, b;
cin>>a>>b;
g[a].pushback(b);
g[b].pushback(a);
}
for (int i=1; i<=n; i++) {
dfs(i);
cont++;
if (!a[i]) {
dfs(i);
cont++;
}
}
g<<cont;
return 0;
}