Pagini recente » Cod sursa (job #1262489) | Cod sursa (job #2786983) | Cod sursa (job #3165368) | Cod sursa (job #881092) | Cod sursa (job #1108276)
#include<vector>
#include<cstdio>
using namespace std;
const int nmax=100003;
vector <int> g[nmax+1];
bool v[nmax+1];
void dfs(int a)
{
v[a] = 1;
for(int i = 0; i<(int)g[a].size(); i++)
{ if(v[g[a][i]]==0)
dfs(g[a][i]);
}
}
int main(){
freopen("dfs.in", "r", stdin);
freopen("dfs.out", "w", stdout);
int n, x, y, m,nr=0;
scanf("%d%d", &n, &m);
for(;m>0;m--){
scanf("%d%d", &x, &y);
g[x].push_back(y);
g[y].push_back(x);
}
for(int i=1;i<=n;i++)
{
if(v[i]==0)
{
dfs(i);
nr++;
}
}
printf("%d\n",nr);
return 0;
}