Pagini recente » Cod sursa (job #2363850) | Cod sursa (job #2743735) | Cod sursa (job #1963212) | Cod sursa (job #1917024) | Cod sursa (job #3198535)
#include <fstream>
#include <vector>
using namespace std;
const int N = 1e5;
vector <int> a[N+1];
bool viz[N+1];
void dfs(int x)
{
viz[x] = true;
for (auto y: a[x])
{
if (!viz[y])
{
dfs(y);
}
}
}
int main()
{
ifstream in("dfs.in");
ofstream out("dfs.out");
int m, n;
in >> n >> m;
for (int i = 0; i < m; i++)
{
int x, y;
in >> x >> y;
a[x].push_back(y);
a[y].push_back(x);
}
int nr_c = 0;
for (int i = 1; i <= n; i++)
{
if (!viz[i])
{
nr_c++;
dfs(i);
}
}
out << nr_c << "\n";
in.close();
out.close();
return 0;
}