并查集

#include<iostream>
#include<stdio.h>
using namespace std;
int pre[100];
int find(int x)
{
    if(x==pre[x])
        return x;
    else
        return find(pre[x]);
}
void join(int a, int b)
{
    int x = find(a);
    int y = find(b);
    pre[x] = y;
}
int main ()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        int n, m;
        scanf("%d %d", &n, &m);
        for(int i = 1; i <= n; i++)
            pre[i] = i;
        for(int i = 1; i <= m; i++)
        {
            int a, b;
            scanf("%d %d", &a, &b);
            join(a, b);
        }
        int ans = 0;
        for(int i = 1; i <= n; i++)
            if(pre[i] == i)
                ans++;
        printf("%d\n", ans);
    }
    return 0;
}