Pagini recente » Cod sursa (job #237656) | Cod sursa (job #1704219) | Cod sursa (job #569875) | Cod sursa (job #3250300) | Cod sursa (job #3156412)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("input1.in");
ofstream fout("output1.out");
const int NMAX = 1e5;
vector<int> G[NMAX + 1];
int vis[NMAX + 1];
void DFS(int x)
{
vis[x] = 1;
for(int i = 0; i < G[x].size(); i++)
{
if(!vis[G[x][i]])
DFS(G[x][i]);
}
}
int main()
{
int n, m;
fin >> n >> m;
int x, y;
for(int i = 1; i <= m; i++)
{
fin >> x >> y;
G[x].push_back(y);
G[y].push_back(x);
}
int cc;
for(int i = 1; i <= n; i++){
if(!vis[i])
{
cc++;
DFS(i);
}
}
fout << cc;
return 0;
}