Pagini recente » Cod sursa (job #2754112) | Cod sursa (job #1296534) | Cod sursa (job #1851533) | Cod sursa (job #2355332) | Cod sursa (job #2486251)
#include <fstream>
#include <vector>
using namespace std;
bool f[200005];
int n,m,ans;
bool da;
vector <int> v[100005];
void dfs(int nod)
{
f[nod]=1;
for(int i=0;i<v[nod].size();++i)
{
if(f[v[nod][i]]==0)
dfs(v[nod][i]);
}
}
ifstream in("dfs.in");
ofstream out("dfs.out");
int main()
{ int a,b;
in>>n>>m;
for(int i=1;i<=m;++i)
{
in>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
for(int i=1;i<=n;++i)
{
if(f[i]==0)
++ans,dfs(i);
}
out<<ans;
return 0;
}