HDU 1213 How Many Tables

#include<iostream>
using namespace std;
int father[1005];
int n;
void Init()
{
for(int i=0;i<1001;i++)
father[i]=i;
}
int find(int x)
{
if(x!=father[x])
father[x]=find(father[x]);
return father[x];
}
void merge_set(int x,int y)
{
int fx=find(x);
int fy=find(y);
if(fx!=fy)
{
n--;
father[fy]=fx;
}

}
int main()
{
int t,b,m,i,x,y;
cin>>t;
b=t;
while(t--)
{
if(t==(b-1)) getchar();
cin>>n>>m;
Init();
for(i=1;i<=m;i++)
{
cin>>x>>y;
merge_set(x,y);
}
cout<<n<<endl;
}
return 0;
}