HDU 1213

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int _max = 1050;
int fa[_max];
int T, N, M;
int u, v;
int Find(int u)
{
	if (u == fa[u]) return fa[u];
	else return fa[u] = Find(fa[u]);
}
void adde(int u, int v)
{
	int x = Find(u);
	int y = Find(v);
	if (x != y) fa[x] = fa[y];
}
int main()
{
	cin>>T;
	while (T--)
	{
		cin>>N>>M;
		for (int i = 1; i <= N; i++)
			fa[i] = i;
		for (int i = 1; i <= M; i++)
		{
			cin>>u>>v;
			adde(u, v);
		}
		int ans = 0;
		for (int i = 1; i <= N; i++)
		{
			if (fa[i] == i) ans++;
		}
		cout<<ans<<endl;
	}
}

1.果然是入门级题目……如果大概了解并查集的基本代码就很容易写出来了……没有任何难点坑点…………