Pagini recente » Cod sursa (job #891619) | Cod sursa (job #450625) | Cod sursa (job #2367435) | Cod sursa (job #2888517) | Cod sursa (job #2608385)
#include <cstdio>
#include <vector>
bool viz[100005];
std::vector<int> G[100005];
void dfs(int nod) {
if(viz[nod] == 0) {
viz[nod] = 1;
for(int i = 0; i < G[nod].size(); ++i)
dfs(G[nod][i]);
}
}
int main() {
int n, m, i, x, y, count = 0;
freopen("dfs.in", "r", stdin);
freopen("dfs.out", "w", stdout);
scanf("%d%d", &n, &m);
for(i = 1; i <= m; ++i) {
scanf("%d%d", &x, &y);
G[x].push_back(y);
G[y].push_back(x);
}
for(i = 1; i <= n; ++i)
if(viz[i] == 0) {
++count;
dfs(i);
}
printf("%d", count);
}