杭电acm1213

并查集

for(i=0; i<m; i++)
//注意要-1，因为这里的i是从0开始
uni(buf[i].x-1, buf[i].y-1);

#include <stdio.h>
#define N 1001

struct d{
	int x;
	int y;
}buf[N];

int parent[N];

int find(int x) {
	return x==parent[x] ? x : find(parent[x]);
}

void uni(int x, int y) {
	int a = find(x);
	int b = find(y);
	if(a==b)
		return ;
	parent[a] = b;
}

int main() {
	
	int t, n, m, i, ans;
	
	scanf("%d", &t);
	while(t--) {
		scanf("%d%d", &n, &m);
		for(i=0; i<n; i++)
			parent[i] = i;
			
		for(i=0; i<m; i++) {
			scanf("%d%d", &buf[i].x, &buf[i].y);
			uni(buf[i].x-1, buf[i].y-1); 
		}
		
		ans = 0;
		for(i=0; i<n; i++) {
			if(parent[i]==i)
				ans ++;
		}
		
		printf("%d\n", ans);
	}
	
	
	return 0;
}