Pagini recente » Cod sursa (job #2722235) | Clasament test1234qwerty | Cod sursa (job #1739314) | Cod sursa (job #99567) | Cod sursa (job #2477970)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
vector < int > v[100005];
bool b[200005];
int x, y, n, m, cont;
void dfs(int nod){
b[nod]=1;
for(auto i:v[nod]){
if(!b[i]){
dfs(i);
}
}
}
int main()
{
in>>n>>m;
for(int i=1;i<=m;i++){
in>>x>>y;
v[y].push_back(x);
v[x].push_back(y);
}
for(int i=1;i<=n;i++){
if(!b[i]){
cont++;
dfs(i);
}
}
out<<cont;
}