Pagini recente » Cod sursa (job #1123573) | Cod sursa (job #770560) | Cod sursa (job #717805) | Cod sursa (job #1653529) | Cod sursa (job #2925560)
//#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
int vizitat[100000];
vector<vector<int>> adiacenta(100001);
int n, m;
void dfs(int k) {
vizitat[k] = 1;
for(int i = 1;i<=n;i++) {
if(adiacenta[k][i] == 1 && vizitat[i] == 0) {
dfs(i);
}
}
}
int x, y;
int main() {
cin >> n >> m;
for(int i = 1;i<=m;i++) {
cin >> x >> y;
adiacenta[x].push_back(y);
adiacenta[y].push_back(x);
}
int rez = 0;
for(int i = 1;i<=m;i++) {
if(vizitat[i] == 0) {
rez++;
dfs(i);
}
}
cout << rez << endl;
}