Pagini recente » Cod sursa (job #337112) | Cod sursa (job #1623592) | Cod sursa (job #2475628) | Cod sursa (job #377850) | Cod sursa (job #3243066)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
const int nMax=100005;
int n , m , x , y , rez;
vector <int> a[nMax];
bool viz[nMax];
ifstream f("dfs.in");
ofstream g("dfs.out");
void dfs(int x)
{
viz[x]=true;
for(size_t i=0;i<a[x].size();i++){
int k=a[x][i];
if(!viz[k]){
dfs(k);
}
}
}
int main()
{
f >> n >> m;
for(int i=1;i<=m;i++){
f >> x >> y;
a[y].push_back(x);
a[x].push_back(y);
}
for(int i=1;i<=n;i++){
if(!viz[i]){
rez++;
dfs(i);
}
}
g << rez;
}