Pagini recente » Cod sursa (job #1910334) | Cod sursa (job #1324050) | Cod sursa (job #1463171) | Cod sursa (job #1004205) | Cod sursa (job #2581112)
#include <bits/stdc++.h>
#define MAX 100000
using namespace std;
vector<int>graph[MAX + 5];
bool vizitat[MAX + 5];
void dfs(int nod)
{
vizitat[nod] = 1;
for(auto x : graph[nod])
if(!vizitat[x])
dfs(x);
}
int main()
{
ifstream fin("dfs.in");
ofstream fout("dfs.out");
ios::sync_with_stdio(false);
fin.tie(0);
fout.tie(0);
srand(time(NULL));
int n, m;
fin >> n >> m;
for(int i = 1; i <= m; i++)
{
int a, b;
fin >> a >> b;
graph[a].push_back(b);
graph[b].push_back(a);
}
int cnt = 0;
for(int i = 1; i <= n; i++)
{
if(!vizitat[i])
{
cnt++;
dfs(i);
}
}
fout << cnt;
fin.close();
fout.close();
return 0;
}