#include<iostream>
#include<cstdio>
using namespace std;
int N,M;
int father[1005];
int find(int x){
if(x == father[x]) return x;
else return father[x] = find(father[x]);
}
int main(){
while(scanf("%d",&N) != EOF){
if(N == 0) break;
scanf("%d",&M);
for(int i = 1;i <= N;++i) father[i] = i;
int x,y;
int ans = N-1;
for(int i = 0;i < M;++i){
scanf("%d%d",&x,&y);
if(find(x) == find(y)) continue;
ans --;
father[find(x)] = find(y);
}
printf("%d\n",ans);
}
return 0;
}
HDU 1232 并查集裸题
最新推荐文章于 2018-10-05 15:04:53 发布