Pagini recente » Cod sursa (job #1345391) | Cod sursa (job #715777) | Cod sursa (job #123813) | Cod sursa (job #1866713) | Cod sursa (job #3238997)
#include<fstream>
#include<vector>
#include<bitset>
std::ifstream fin("dfs.in");
std::ofstream fout("dfs.out");
const int NMAX=100005;
std::vector<int>G[NMAX];
std::bitset<NMAX>f;
int n, m;
void read()
{
fin>>n>>m;
for(int i=0; i<m; ++i)
{
int from, to;
fin>>from>>to;
G[from].push_back(to);
G[to].push_back(from);
}
}
void dfs(int node)
{
f[node]=true;
for(auto it:G[node])
if(!f[it])
dfs(it);
}
void solve()
{
int ans=0;
for(int i=1; i<=n; ++i)
{
if(!f[i])
{
dfs(i);
++ans;
}
}
fout<<ans;
}
int main()
{
read();
solve();
return 0;
}