2639: Junk-Mail Filter

#include<iostream>
#include<string.h>
#include<cstdio>
using namespace std;
int fath[2300000],c[2300000],num[2300000];
int find(int x)
{
 return fath[x]==x?x:fath[x]=find(fath[x]);
}
void uion(int x,int y)
{
 fath[y]=x;
}
int main()
{
 int n,m,i,x,y;char ch;
 int p=1;
 while(scanf("%d%d",&n,&m),n||m)
 {
  int l=n+1;
  for(i=0;i<n;i++) fath[i]=n;
  for(i=n;i<2300000;i++) fath[i]=i;
  while(m--)
  {
   cin>>ch;
   if(ch=='M')
   {
    scanf("%d%d",&x,&y);
    if(find(x)==find(y)&&find(x)!=n) continue;
    else if(find(x)==n&&find(y)==n) {uion(l,x);uion(l++,y);}
    else if(find(x)!=n&&find(y)==n) uion(find(x),y);
    else if(find(x)==n&&find(y)!=n) uion(find(y),x);
    else uion(find(x),find(y));
   // for(int j=0;j<n;j++) cout<<fath[j]<<"...";cout<<"*******"<<fath[5]<<endl;
   }
   else
   {
    scanf("%d",&x);
    fath[x]=n;
   // for(int j=0;j<n;j++) cout<<fath[j]<<"...";cout<<"********"<<fath[5]<<endl;
   }
  }
   int countc=0;
   memset(num,0,sizeof(num));
   for(i=0;i<n;i++)
   {
    if(find(i)==n) {countc++;continue;}
    num[find(i)]=1;
   }
  // cout<<countc<<endl;
   for(i=n+1;i<l;i++) if(num[i]==1) countc++;
   printf("Case #%d: %d/n",p++,countc);
 }
 return 0;
}