pku1970.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>
int map[19][19];
int D[4][2] = {{1, 1}, {-1, 1}, {1, 0}, {0, 1}};
int winner;
int winx, winy;
int found;
int In(int x, int y)
{
	if (x < 0 || x >= 19 || y < 0 || y >= 19)
	{
		return 0;
	}
	return 1;
}

Five(int color, int dis, int x, int y)
{
	int i, dx = D[dis][0], dy = D[dis][1];
	if (In(x - dx, y - dy) == 1 && map[x - dx][y - dy] == color)
	{
		return 0;
	}
	if (In(x + 4 * dx, y + 4 * dy) == 0)
	{
		return 0;
	}
	for (i = 1; i < 5; i++)
	{
		if (map[x + i * dx][y + i * dy] != color)
		{
			return 0;
		}
	}
	if (In(x + 5 * dx, y + 5 * dy) && map[x + 5 * dx][y + 5 * dy] == color)
	{
		return 0;
	}
	return 1;
}

int main()
{
	int T, i, j, k;
	scanf("%d", &T);
	while (T--)
	{
		winner = 0;
		winx = 0;
		winy = 0;
		for (i = 0; i < 19; i++)
		{
			for (j = 0; j < 19; j++)
			{
				scanf("%d", &map[i][j]);
			}
		}
		for (i = 0; i < 19; i++)
		{
			for (j = 0; j < 19; j++)
			{
				if (map[i][j] != 0)
				{
					for (k = 0; k < 4; k++)
					{
						if (Five(map[i][j], k, i, j))
						{
							if (winner == 0)
							{
								winner = map[i][j];
								winx = i + 1;
								winy = j + 1;
								i = 19;
								j = 19;
								k = 4;
								break;
							}
						}
					}
				}
			}
		}
		if (winner)
		{
			printf("%d\n", winner);
			printf("%d %d\n", winx, winy);
		}
		else
		{
			printf("0\n");
		}
	}
	return 0;
}