标签:print -- 技术 col closed printf div lap main
#include <stdio.h> #include <stdlib.h> int n,m; int father[1000],rank[1000]; int count; int find(int x) { if(father[x]==x) return x; else return father[x]=find(father[x]); } void unit(int x,int y) { x=find(x); y=find(y); if(x==y) return; if(rank[x]<rank[y]){ father[x]=y; count--; }else{ father[y]=x; if(rank[x]==rank[y]) rank[x]++; count--; } } int main() { while(scanf("%d",&n)==1){ if(n==0) break; scanf("%d",&m); count=n; int i; //初始化 for(i=0;i<n;i++){ father[i]=i; rank[i]=0; } int x,y; for(i=0;i<m;i++){ scanf("%d%d",&x,&y); unit(x-1,y-1); } printf("%d\n",count-1); } return 0; }
标签:print -- 技术 col closed printf div lap main
原文地址:https://www.cnblogs.com/clljs/p/9931838.html