#include<iostream>
#define MAX 25

using namespace std;

struct POINT
{
	int x, y;
	int d;
};

int map[MAX][MAX];
int sum;



int slove(int x, int y)
{
	int i, j;
	int n;
	int flag;
	struct POINT pt[MAX*MAX];
	int min;
	int tx, ty;

	map[x][y] = 0;
	n = 0;
	flag = 0;



	for(i = x;i < MAX;i++)
	{
		for(j = y;j < MAX;j++)
		{
			if(map[i][j] == 1)
			{
				pt[n].x = i;
				pt[n].y = j;
				pt[n].d = i*i + j*j;
				n++;
/*
				cout << "x = " << x << "y = " << y << "\n";
				cout << "px = " << i << "py = " << j << "d = " << x*x + y*y << '\n';
*/
				flag = 1;
			}
		}
	}

	if(flag == 0)
	{
		sum++;
		return 0;
	}

	


	min= MAX * MAX + MAX * MAX + 1;

	tx = x;
	ty = y;

	while(n--)
	{
		if(pt[n].d < min)
		{
			x = pt[n].x;
			y = pt[n].y;
			min = pt[n].d;
		}
	}

	/*
cout << "sum = " << sum <<'\n';
		cout << "x = " << x << "y = " << y << '\n';
		cout << "tx = " << tx << "ty = " << ty << '\n';
*/

	if(tx != x  || ty != y)
	{
	
		slove(x, y);
	}

}


main()
{
	int x, y;
	int i, j;

	while(1)
	{
	for(i = 0;i < MAX;i++)
		for(j = 0;j < MAX;j++)
			map[i][j] = 0;


	while(1)
	{
		cin >> x >> y;

		if(x == -1 && y == -1)
			return 1;

		if(x == 0 && y == 0)
			break;
		map[x-1][y-1] = 1;
	}

	sum = 0;

	for(x = 0;x < MAX;x++)
		for(y = 0;y < MAX;y++)
		{
			if(map[x][y] == 1)
			{
			
				slove(x, y);
			}
		}

		cout << sum << '\n';
	}
}

• 网上有数据和标程，可以参考 (0) gz2001 2003-11-11 22:57:44
  • Re:网上有数据和标程，可以参考 (6) monkeyfu 2003-11-12 16:30:51
  • Re:网上有数据和标程，可以参考 (0) Gouffre 2005-04-24 14:48:02
    • Re:网上有数据和标程，可以参考 (0) sunlimiao 2006-06-28 15:07:05
  • Re:网上有数据和标程，可以参考 (6) looker 2010-07-29 17:14:25