1 #include
      
        2 int father[100005],members[100005]; 3 int find(int a) 4 { 5     if(father[a]!=a) 6         father[a]=find(father[a]); 7     return father[a]; 8 }//寻找祖先 9 int main()10 {11     int i,m,n,b,a,num=1;12     char ch;13     while(scanf("%d%d",&n,&m)==2)14     {15         if (num!=1) printf("\n");16             printf("Case %d:\n",num++);17         for(i=1;i<=n;i++)18         {19             father[i]=i;20             members[i]=1;21         }//初始化22         for(i=0;i