hdu1213

http://acm.hdu.edu.cn/showproblem.php?pid=1213

#include<iostream>
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
using namespace std;
const int N=1005;
int father[N];
int find(int x)
{
    if(father[x]!=x)
    father[x]=find(father[x]);
    return father[x];
}
void make(int a,int b)
{
    int f1=find(a);
    int f2=find(b);
    if(f1!=f2)
    father[f2]=f1;
    return ;
}

int main()
{
    //freopen("in.txt","r",stdin);
    int t;
    cin>>t;
    while(t--)
    {
        int n,m,a,b;
        cin>>n>>m;
        for(int i=0;i<N;i++)
        father[i]=i;
        for(int i=0;i<m;i++)
        {
            cin>>a>>b;
            make(a,b);
        }
        int cnt=0;
        for(int i=1;i<=n;i++)
        {
            if(father[i]==i)
            cnt++;
        }
        cout<<cnt<<endl;
    }
    return 0;
}