Pagini recente » Cod sursa (job #2698996) | Cod sursa (job #2689052) | Cod sursa (job #924212) | Cod sursa (job #1365230) | Cod sursa (job #1193063)
#include <cstdio>
#include <vector>
using namespace std;
int x, y, i, n, m, used[100001], nr;
vector<int> V[100001];
void dfs(int x){
if(used[x] == true)
return;
used[x] = true;
for(int j = 0; j < V[x].size(); ++j)
dfs(V[x][j]);
}
int main(){
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),
V[x].push_back(y),
V[y].push_back(x);
for(i = 1; i <= n; ++i){
if(used[i] == false)
++nr;
dfs(i);
}
printf("%d\n", nr);
}