#include <stdio.h>

int student[50001],n=0;
int count;

inline int find(int x)
{
	while(student[x]!=x)
	{
		x=student[x];
	}
	return x;
}

void change(int x,int y)
{
	int i=0;
	int px=find(x),py=find(y);
	if(px!=py)
	{
		--count;
		student[px]=py;
	}
	return;
}

int main(void)
{
	int k=0,m=0;
	int i=0,x=0,y=0;

	while(scanf("%d%d",&n,&m)&&n+m)
	{
		for(i=1;i<=n;++i)
		{
			student[i]=i;
		}
		count=n;
		for(i=0;i<m;++i)
		{
			scanf("%d%d",&x,&y);
			change(x,y);
		}	
		printf("Case %d: %d\n",++k,count);
	}
}

• Re:贴个282ms的代码，求2位数代码写法 (833) 3013216027 2014-08-09 10:06:33
• Re:贴个282ms的代码，求2位数代码写法 (100) 3013216027 2014-08-09 10:10:07