Pagini recente » Cod sursa (job #2279282) | Cod sursa (job #356949) | Cod sursa (job #1702464) | Cod sursa (job #2085412) | Cod sursa (job #1441285)
#include<cstdio>
#include<vector>
using namespace std;
int vc[100001],nr=0;
vector<vector<int> > v(100001);
void dfs(int nod){
int a=v[nod].size(),i;
vc[nod]=1;
for(i=0;i<a;i++)
if(vc[v[nod][i]]==0)
dfs(v[nod][i]);
}
int main(){
freopen("dfs.in","r",stdin);
freopen("dfs.out","w",stdout);
int n,m,i,a,b;
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++){
scanf("%d%d",&a,&b);
v[a].push_back(b);
v[b].push_back(a);
}
for(i=1;i<=n;i++)
if(vc[i]==0){
nr++;
dfs(i);
}
printf("%d",nr);
return 0;
}