解题思路：和畅通工程类似，问最后还剩下几个不连通的区域。

How Many Tables

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15086    Accepted Submission(s): 7364

Problem Description

Today is Ignatius‘ birthday. He invites a lot of friends. Now it‘s dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with strangers.
One important rule for this problem is that if I tell you A knows B, and B knows C, that means A, B, C know each other, so they can stay in one table.
For example: If I tell you A knows B, B knows C, and D knows E, so A, B, C can stay in one table, and D, E have to stay in the other one. So Ignatius needs 2 tables at least.

Input

The input starts with an integer T(1<=T<=25) which indicate the number of test cases. Then T test cases follow. Each test case starts with two integers N and M(1<=N,M<=1000). N indicates the number of friends, the friends are marked from 1 to N. Then M lines follow. Each line consists of two integers A and B(A!=B), that means friend A and friend B know each other. There will be a blank line between two cases.

Output

For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.

Sample Input

2
5 3
1 2
2 3
4 5

5 1
2 5

Sample Output

2
4

Author

Ignatius.L

#include<stdio.h>
int pre[1005];
int find(int root)
{ return root == pre[root] ? root : pre[root] = find(pre[root]); }

void unionroot(int root1,int root2)
{
	int x,y;
	x=find(root1);
	y=find(root2);
	if(x!=y);
	pre[x]=y;

}

int main()
{
	int i,ncase,n,m,tmp,root1,root2,x,y;
	scanf("%d",&ncase);
	while(ncase--)
	{
		tmp=0;
		scanf("%d %d",&n,&m);
		for(i=1;i<=n;i++)
		pre[i]=i;

	while(m--)
	{
			scanf("%d %d",&root1,&root2);
			x=find(root1);
			y=find(root2);
			unionroot(x,y);
	}

		for(i=1;i<=n;i++)
		{
			if(pre[i]==i)
			tmp++;
		}
		printf("%d\n",tmp);

	}
}