1955.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1955 on 2006-02-21 at 13:20:41 */ 
#include <cstdio>

const int MAX = 4;

char map[MAX][MAX];

bool win(char);

int main()
{
	int t, T, i, j;
	
	scanf("%d", &T);
	for(t = 0; t < T; t++) {
		for(i = 0; i < 3; i++) scanf("%s", map[i]);
		int xn = 0, on = 0;
		for(i = 0; i < 3; i++)
			for(j = 0; j < 3; j++)
				if(map[i][j] == 'X') xn++;
				else if(map[i][j] == 'O') on++;
		bool xw = win('X'), ow = win('O'), vaild = true;
		if(xn != on && xn != on+1) vaild = false;
		else if(xw && ow) vaild = false;
		else if(xn == on+1 && ow) vaild = false;
		else if(xn == on && xw) vaild = false;
		printf("%s\n", vaild ? "yes" : "no");
	}
	
	return 0;
}

bool win(char player)
{
	int i, j;
	for(i = 0; i < 3; i++) {
		bool row = true, col = true;
		for(j = 0; j < 3; j++) {
			if(map[i][j] != player) row = false;
			if(map[j][i] != player) col = false;
		}
		if(row || col) return true;
	}
	bool left = true, right = true;
	for(i = 0; i < 3; i++) {
		if(map[i][i] != player) left = false;
		if(map[i][2-i] != player) right = false;
	}
	return left || right;
}