hdu1232 暢通工程 並查集模板題

hdu1232 暢通工程 並查集模板題 emm套版子就可以，但是感覺能想出這個的人很有意思 很簡潔

//其實就是c
#include<stdio.h>
#include<string.h>
using namespace std;

int n, m, fa[1005], a, b, record[1005], cnt;
void Init(int size)
{
	for (int i = 0; i < size; i++)
		fa[i] = i;
}
int Find(int x)//此函數會壓縮路徑
{
	if (fa[x] == x)return x;
	return fa[x] = Find(fa[x]);
}
void Union(int x, int y)
{
	int a = Find(x), b = Find(y);
	if (a != b)fa[a] = b;
}
int main()//並查集+路徑壓縮爲o(1)
{
	while (scanf("%d", &n) && n != 0) {
		scanf("%d", &m);
		Init(1005); memset(record, 0, sizeof(record)); cnt = 0;
		for (int i = 1; i <= m; i++) {
			scanf("%d %d", &a, &b);
			Union(a, b);
		}
		for (int i = 1; i <= n; i++) {
			record[Find(i)]++;
		}
		for (int i = 1; i <= n; i++) {
			if (record[i] > 0)cnt++;
		}
		printf("%d\n", cnt - 1);
	}
}