Pagini recente » Cod sursa (job #563664) | Cod sursa (job #2058222) | Cod sursa (job #1785914) | Cod sursa (job #436464) | Cod sursa (job #2948766)
//#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
int n, m;
vector<int>vecini[100005];
vector<int> vizitat(n+1);
void dfs(int k) {
vizitat[k] = 1;
for(auto it: vecini[k]) {
if(!vizitat[it] == 0) {
dfs(it);
}
}
}
int x, y;
int main() {
cin >> n >> m;
for(int i = 1;i<=m;i++) {
cin >> x >> y;
vecini[x].push_back(y);
vecini[y].push_back(x);
}
int rez = 0;
for(int i = 1;i<=m;i++) {
if(vizitat[i] == 0) {
rez++;
dfs(i);
}
}
cout << rez << endl;
}