Pagini recente » Cod sursa (job #142695) | Cod sursa (job #1972329) | Cod sursa (job #247237) | Cod sursa (job #2248652) | Cod sursa (job #2665717)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector<int> v[100005];
int n,m,x,y,a[100005],c;
void dfs(int nod)
{
a[nod]=1;
for(int i=0;i<v[nod].size();i++)
if(!a[v[nod][i]])
dfs(v[nod][i]);
}
void parc()
{
for(int i=1;i<=n;i++)
if(a[i]==0)
{
c++;
dfs(i);
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
parc();
g<<c;
f.close();
g.close();
return 0;
}