1956757_wa.c

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

# include <stdio.h>

char grid[3][4];

int win(char ch)
{
	if(grid[1][1]==ch)
	{
		if(grid[0][0]==grid[2][2]&&grid[0][0]==ch)
			return 1;
		if(grid[0][1]==grid[0][2]&&grid[0][1]==ch)
			return 1;
		if(grid[1][0]==grid[1][2]&&grid[1][0]==ch)
			return 1;
		if(grid[0][2]==grid[2][0]&&grid[0][2]==ch)
			return 1;
	}
	if(grid[0][0]==ch)
	{
		if(grid[0][1]==grid[0][2]&&grid[0][1]==ch)
			return 1;
		if(grid[1][0]==grid[2][0]&&grid[1][0]==ch)
			return 1;
	}
	if(grid[2][2]==ch)
	{
		if(grid[2][1]==grid[2][0]&&grid[2][0]==ch)
			return 1;
		if(grid[0][2]==grid[1][2]&&grid[0][2]==ch)
			return 1;
	}
	return 0;
}
int main()
{
	int i, j, k, n;
	int numx, numo;
	
	scanf("%d",&n);
	for(i = 0; i < n; i++)
	{
		numx = numo = 0;
		for(j = 0; j < 3; j++)
		{
			scanf("%s",grid[j]);
			for(k = 0; k < 3; k++)
			{
				if(grid[j][k]=='X')
					numx++;
				if(grid[j][k]=='O')
					numo++;
			}
		}
			if(win('X'))
			{
				if(win('O'))
					printf("no\n");
				else
					if(numx==numo+1)
						printf("yes\n");
					else
						printf("no\n");
			}
			else
			{
				if(win('O'))
				{
					if(numx==numo)
						printf("yes\n");
					else
						printf("no\n");
				}
				else
				{
					if(numx==numo||numx==numo+1)
						printf("yes\n");
					else
						printf("no\n");
				}
			}
	}
	return 1;
}