2119690_ac_15ms_16k.c

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <string.h>
int game[20][20];
int mark[4];

void input ()
{
	int i, j;
	for (i = 0; i < 19; i++)
		for (j = 0; j < 19; j++)
			scanf ("%d", &game[i][j]);
}
void mange ( )
{
	int i, j;
	mark[0] = 0;
	mark[1] = mark[2] = -1;
	for (i = 0; i < 19; i ++)
		for (j = 0; j < 19; j++)
		{
			if (game[i][j] == 0)
				continue;
			if (i > 1 && i < 18)
				if(game[i][j] == game[i-2][j]&&game[i][j] == game[i-1][j]&&game[i][j] == game[i+1][j]&&game[i][j] == game[i+2][j])
			{
				mark [0] = game [i][j];
				mark [1] = i - 2;
			    mark [2] = j;
			    if ((i > 2 && game[i][j] == game[i-3][j]) || (i < 16 && game[i][j] == game[i+3][j]))
			    mark[0] = 0;
			}
		    if (i > 1 && i < 18 && j > 1 && j < 18)
				if (game[i][j] == game[i-2][j-2]&&game[i][j] == game[i-1][j-1]&&game[i][j] == game[i+1][j+1]&&game[i][j] == game[i+2][j+2])
			{
				mark [0] = game [i][j];
				mark [1] = i - 2;
			    mark [2] = j - 2;
			    if ((i > 2 && j > 2&& game[i][j] == game[i-3][j-3]) || (i < 16 && j < 16&&game[i][j] == game[i+3][j+3] ))
			    mark[0] = 0;
			}
			if (i > 1 && i < 18 && j > 1 && j < 18)
				if (game[i][j] == game[i-2][j+2]&&game[i][j] == game[i-1][j+1]&&game[i][j] == game[i+1][j-1]&&game[i][j] == game[i+2][j-2])
			{
				mark [0] = game [i][j];
				mark [1] = i + 2;
			    mark [2] = j - 2;
			    if ((i > 2 && j < 16 && game[i][j] == game[i-3][j+3]) || (i < 16 && j > 2&&game[i][j] == game[i+3][j-3]))
			    mark[0] = 0;
			}
			if (j > 1 && j < 18)
				if (game[i][j] == game[i][j-2]&&game[i][j] == game[i][j-1]&&game[i][j] == game[i][j+1]&&game[i][j] == game[i][j+2])
			{
				mark [0] = game [i][j];
				mark [1] = i;
			    mark [2] = j - 2;
			    if ((j > 2 && game[i][j] == game[i][j-3]) || (j<16&&game[i][j] == game[i][j+3]))
			    mark[0] = 0;
			}
		    if (mark[0] != 0)
				return ;

		}
}
void output ()
{
	printf ("%d\n", mark[0]);
	if (mark[0] != 0)
		printf ("%d %d\n", mark[1]+1, mark[2]+1);
}

int main ()
{
	int n;
	scanf ("%d", &n);
	while(n --)
        {
		input ();
		mange ();
		output ();
	}
    return 0;

}