（模拟）uva 220 黑白棋

#include <cstring>
#include <iostream>
#include <cstdio>
using namespace std;
int board[10][10],xx,yy,queue[9],rear;
//player 1 and 2;
void print_b() {
	for(int i=1;i<=8;i++) 
	{
		for(int m=1;m<=8;m++) printf("%c",board[i][m]? board[i][m]==1?'B':'W' : '-');
		printf("\n");
	}
}
char rd() {
	char ch;
	while((ch=getchar())==' ') continue;
	return ch;
}
int islegal(int i,int j,int player,bool kai = 0) {
	int find = player==1? 2 : 1,ola(0);
	int m=i,n=j;
	while(board[m][n+1]==find) n++;if(n>j && board[m][n+1]==player) {
		ola = 1;
		if(kai) goto ext;
		queue[rear++]=1;
	} 
	n=j;
	while(board[m+1][n]==find) m++;if(m>i && board[m+1][n]==player) {
		ola = 1;
		if(kai) goto ext;
		queue[rear++] = 2;
	}
	m=i;
	while(board[m][n-1]==find) n--;if(n<j && board[m][n-1]==player) {
		ola = 1;
		if(kai) goto ext;
		queue[rear++] = 3;
	} 
	n=j;
	while(board[m-1][n]==find) m--;if(m<i && board[m-1][n]==player) {
		ola = 1;
		if(kai) goto ext;
		queue[rear++] = 4;
	}
	m=i;
	while(board[m+1][n+1]==find) m++,n++;if(m>i && board[m+1][n+1]==player) {
		ola = 1;
		if(kai) goto ext;
		queue[rear++] = 5;
	}
	n=j;m=i;
	while(board[m+1][n-1]==find) m++,n--;if(m>i && board[m+1][n-1]==player) {
		ola = 1;
		if(kai) goto ext;
		queue[rear++] = 6;
	}
	n=j;m=i;
	while(board[m-1][n-1]==find) m--,n--;if(m<i && board[m-1][n-1]==player) {
		ola = 1;
		if(kai) goto ext;
		queue[rear++] = 7;
	}
	n=j;m=i;
	while(board[m-1][n+1]==find) m--,n++;if(m<i && board[m-1][n+1]==player) {
		ola = 1;
		if(kai) goto ext;
		queue[rear++] = 8;
	}
	n=j;m=i;
	ext:;
	return ola;
}
void place(int dir,int i,int j,int cur) {//维护xx及改变路径；
    int cnt(0),f=cur==1?2:1;
//    board[i][j]=cur;
    switch(dir)
    {
    	case 1: while(board[i][j+1]==f) cnt++,board[i][j+1]=cur,j++;break;
    	case 2: while(board[i+1][j]==f) cnt++,board[i+1][j]=cur,i++;break;
    	case 3: while(board[i][j-1]==f) cnt++,board[i][j-1]=cur,j--;break;
    	case 4: while(board[i-1][j]==f) cnt++,board[i-1][j]=cur,i--;break;
    	case 5: while(board[i+1][j+1]==f) cnt++,board[i+1][j+1]=cur,i++,j++;break;
    	case 6: while(board[i+1][j-1]==f) cnt++,board[i+1][j-1]=cur,i++,j--;break;
    	case 7: while(board[i-1][j-1]==f) cnt++,board[i-1][j-1]=cur,i--,j--;break;
    	case 8: while(board[i-1][j+1]==f) cnt++,board[i-1][j+1]=cur,i--,j++;break;
    	default:return ;
	}
	if(cur==1) xx+=cnt,yy-=cnt;
	else if(cur==2) xx-=cnt,yy+=cnt;
}
int main()
{       //1 stands for black,2 stands for white.xx shows the num of black ,yy the while

//	freopen("in.txt","r",stdin);
//	freopen("out.txt","w",stdout);
	int cur=1,T,first=1,ok,p;
	char ch;
	scanf("%d%*c",&T);
	while(T--) {
		xx=0;yy=0;
		for(int i=1;i<=8;i++) {
			for(int j=1;j<=8;j++) {
				ch=getchar();
				if(ch=='-') board[i][j]=0;
				else if(ch=='B') board[i][j]=1,xx++;
				else if(ch=='W') board[i][j]=2,yy++;
			}
			getchar();
		}
		ch = getchar() ;getchar();
		cur = ch=='B'? 1:2;
		while((ch=getchar())!='Q') {
			if(ch=='L') {
				first=1,ok=0;
				for(int i=1;i<=8;i++) 
				for(int j=1;j<=8;j++)
				if(!board[i][j] && islegal(i,j,cur,1)) {
					if(first) first=0;else printf(" ");
					ok=1;
					printf("(%d,%d)",i,j);
				}
				if(!ok) printf("No legal move.");
			}else if(ch=='M') {
				int num=getchar()-48,num2=getchar()-48;
				rear = 0;
				if(!islegal(num,num2,cur)) cur=cur==1?2:1,islegal(num,num2,cur);
				for(int loo = 0; loo < rear; loo++) place(queue[loo],num,num2,cur);
				board[num][num2] = cur;
				if(cur==1) xx++;
				else yy++;
				cur = cur==1? 2:1;
				printf("Black - %2d White - %2d",xx,yy);
			}
			getchar();
			putchar('\n');
		}
		getchar();
		print_b();
		if(T>0) putchar('\n');
	}
	return 0;
}