POJ 2524 并查集

//11160831	c00h00g	2524	Accepted	632K	313MS	G++	851B	2013-01-06 09:42:44
//简单的并查集，主要是如何统计集合的个数，如果有一个共同的祖先则统计一次 
#include<cstdio>
#include<cstdlib>

int pa[50005];
bool vis[50005];
int findset(int x){return pa[x]!=x?pa[x]=findset(pa[x]):x;}

int main(){
    int i,j,n,m,a,b,cases=0;
    while(scanf("%d%d",&n,&m)!=EOF){
        if(m==0&&n==0)
            break;
        int res=0;
        for(i=1;i<=n;i++) { pa[i]=i; vis[i]=0;}
        for(i=0;i<m;i++){
            scanf("%d%d",&a,&b);
            int x=findset(a);
            int y=findset(b);
            if(x!=y){
                if(x<y)
                    pa[y]=x;
                else
                    pa[x]=y;
            }
        }
        for(i=1;i<=n;i++){
            int tmp=findset(i);
            if(vis[tmp]==0){
                vis[tmp]=1;
                res++;
            }
        }
        printf("Case %d: %d\n",++cases,res);
    }
    return 0;
}