黑白棋

#include <cstdio>
#include <limits.h>
#include <vector>

using namespace std;

void updateBoard(vector<vector<char>>& board, int x, int y, char type,char enemy)
{
 int i, j;

 for (i = x - 1; i >= 0 && board[i][y] == enemy; --i)
  ;
 if (i >= 0 && board[i][y] == type)
  while (i < x) board[i++][y] = type;

 for (i = x + 1; i < 8 && board[i][y] == enemy; ++i)
  ;
 if (i < 8 && board[i][y] == type)
  while (i > x) board[i--][y] = type;

 for (j = y - 1; j >= 0 && board[x][j] == enemy; --j)
  ;
 if (j >= 0 && board[x][j] == type)
  while (j < y) board[x][j++] = type;

 for (j = y + 1; j < 8 && board[x][j] == enemy; ++j)
  ;
 if (j < 8 && board[x][j] == type)
  while (j > y) board[x][j--] = type;

 for (i = x - 1, j = y - 1; i >= 0 && j >= 0 && board[i][j] == enemy; --i, --j)
  ;
 if (i >= 0 && j >= 0 && board[i][j] == type)
  while (i < x && j < y) board[i++][j++] = type;

 for (i = x + 1, j = y - 1; i < 8 && j >= 0 && board[i][j] == enemy; ++i, --j)
  ;
 if (i < 8 && j >= 0 && board[i][j] == type)
  while (i > x && j < y) board[i--][j++] = type;

 for (i = x - 1, j = y + 1; i >= 0 && j < 8 && board[i][j] == enemy; --i, ++j)
  ;
 if (i >= 0 && j < 8 && board[i][j] == type)
  while (i < x && j > y) board[i++][j--] = type;

 for (i = x + 1, j = y + 1; i < 8 && j < 8 && board[i][j] == enemy; ++i, ++j)
  ;
 if (i < 8 && j < 8 && board[i][j] == type)
  while (i > x && j > y) board[i--][j--] = type;
}

int main()
{
 //freopen("in.txt", "r", stdin);
 char c;
 vector<vector<char>> board(8, vector<char>(8));
 int x, y;
 while ((c = getchar()) != EOF)
 {
  ungetc(c,stdin);
  for (int i = 0; i < 8; ++i)
  {
   for (int j = 0; j < 8; ++j)
    board[i][j] = getchar();
   getchar();
  }
  scanf("%d %d %c\n", &x, &y, &c);
  --x; --y;
  board[x][y] = c;
  if(c == '+') updateBoard(board, x, y, '+','*');
  else updateBoard(board, x, y, '*', '+');

  for (int i = 0; i < 8; ++i)
  {
   for (int j = 0; j < 8; ++j)
    putchar(board[i][j]);
   putchar('\n');
  }
  putchar('\n');
 }

 return 0;
}

import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while (sc.hasNext()) {
			Character[][] map = new Character[8][8];
			for (int i = 0; i < 8; i ++ ) {
				String s = sc.next();
				for (int j = 0; j < 8; j ++ )
					map[i][j] = s.charAt(j);
			}
			int row = sc.nextInt() - 1;
			int col = sc.nextInt() - 1;
			Character c = sc.next().charAt(0);
			map[row][col] = c;
			fun(map, row, col, c);
			for (int i = 0; i < map.length; i ++ ) {
				for (int j = 0; j < map[0].length; j ++ ) {
					if(j == map[0].length - 1) System.out.println(map[i][j]);
					else System.out.print(map[i][j]);
				}
			}
			System.out.println();
		}
	}

	public static void fun(Character[][] map, int row, int col, Character c) {
		int[][] direction = {{0, 1}, {0, - 1}, {1, 0}, { - 1, 0}, {1, 1}, {1, - 1}, { - 1, 1}, { - 1, - 1}};
		for (int i = 0; i < direction.length; i ++ ) {
			int x = row + direction[i][0];
			int y = col + direction[i][1];
			while (x >= 0 && x < map.length && y >= 0 && y < map[0].length && map[x][y] != c && map[x][y] != '.') {
				x += direction[i][0];
				y += direction[i][1];
			}
			if(x >= 0 && x < map.length && y >= 0 && y < map[0].length && map[x][y] == c) {
				while (map[x -= direction[i][0]][y -= direction[i][1]] != c)
					map[x][y] = c;
			}
		}
	}
}

#include <iostream>
#include <vector>
using namespace std;

#define N 8

void solve(vector<vector<char> > & map, int x, int y, char c)
{
	int dir[8][2] = { {-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1} };
	map[x][y] = c;

	for (int i = 0; i < 8; ++i)
	{
		int count = 1, flag = 0;
		int nx = x + dir[i][0];
		int ny = y + dir[i][1];
		if (c == '*')
		{
			while (nx >= 0 && nx <= N && ny >= 0 && ny <= N && map[nx][ny] == '+')
				nx += dir[i][0], ny += dir[i][1];
			if (nx >= 0 && nx <= N && ny >= 0 && ny <= N && map[nx][ny] == '*')
			{
				nx -= dir[i][0], ny -= dir[i][1];
				while (map[nx][ny] == '+')
				{
					map[nx][ny] = '*';
					nx -= dir[i][0], ny -= dir[i][1];
				}
			}
		}
		else if (c == '+')
		{
			while (nx >= 0 && nx <= N && ny >= 0 && ny <= N && map[nx][ny] == '*')
				nx += dir[i][0], ny += dir[i][1];
			if (nx >= 0 && nx <= N && ny >= 0 && ny <= N && map[nx][ny] == '+')
			{
				nx -= dir[i][0], ny -= dir[i][1];
				while (map[nx][ny] == '*')
				{
					map[nx][ny] = '+';
					nx -= dir[i][0], ny -= dir[i][1];
				}
			}
		}
	}
}

int main() 
{
	char ch;
	while (cin >> ch)
	{
		vector<vector<char> > map(10, vector<char>(10, '.'));
		map[1][1] = ch;
		for (int i = 1; i <= N; ++i)
			for (int j = 1; j <= N; ++j)
			{
				if (i == 1 && j == 1) continue;
				cin >> ch;
				map[i][j] = ch;
			}

		int x, y;
		cin >> x >> y >> ch;
		solve(map, x, y, ch);

		for (int i = 1; i <= N; ++i)
		{
			for (int j = 1; j <= N; ++j)
				cout << map[i][j];
			cout << endl;
		}
		cout << endl;
	}

	return 0;
}