Pagini recente » Cod sursa (job #2169104) | Cod sursa (job #1778890) | Cod sursa (job #1567744) | Cod sursa (job #2710806) | Cod sursa (job #2486238)
#include <fstream>
#include <vector>
#define N 100005
using namespace std;
ifstream cin ("dfs.in");
ofstream cout ("dfs.out");
long long cnt=0;
vector <int> g[N];
bool f[N];
void dfs (int u)
{
f[u]=true;
for(int i=0;i<g[u].size();++i)
{
int v=g[u][i];
if(!f[v])
{
dfs(v);
}
}
}
int main()
{
int n,m, a, b;
cin>>n>>m;
for(int i=0;i<m;i++)
{
cin>>a>>b;
g[a].push_back(b);
g[b].push_back(a);
}
for(int i=1;i<-n;i++)
{
if(!f[i])
{
cnt++;
dfs(i);
}
}
cout<<cnt;
}