[HDU-1213]How Many Tables

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<map>

using namespace std;

const int maxn = 1000 + 10;

int parent[maxn];
int ans;

int GetParent(int a) {
    if( parent[a] != a ) {
        parent[a] = GetParent( parent[a] );
    }
    return parent[a];
}

void Merge(int a, int b) {
    int pa = GetParent( a );
    int pb = GetParent( b );
    if( pa == pb ) {
        return ;
    }
    ans--;
    parent[pb] = pa;
}



int main() {
    int T;
    cin >> T;
    while( T-- ) {
        int N, M;
        cin >> N >> M;
        for(int i=1; i<=N; i++) {
            parent[i] = i;
        }
        ans = N;
        while( M-- ) {
            int a, b;
            cin >> a >> b;
            Merge( a, b );
        }
        cout << ans << endl;
    }
    return 0;
}