Pagini recente » Cod sursa (job #65563) | Istoria paginii utilizator/aletse | Cod sursa (job #661288) | Cod sursa (job #2894748) | Cod sursa (job #2979790)
#include <fstream>
#include <vector>
using namespace std;
const int N = 100000;
vector <int> la[N + 1];
bool viz[N + 1];
void dfs(int a)
{
viz[a] = true;
for (auto urm: la[a])
{
if (!viz[urm])
{
dfs(urm);
}
}
}
int main()
{
ifstream in("dfs.in");
ofstream out("dfs.out");
int n, m;
in >> n >> m;
for (int i = 0; i < m; i ++)
{
int x, y;
in >> x >> y;
la[x].push_back(y);
la[y].push_back(x);
}
int cc = 0;
for (int i = 1; i <= n; i ++)
{
if (!viz[i])
{
dfs(i);
cc ++;
}
}
out << cc;
in.close();
out.close();
return 0;
}