Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var scanner = bufio.NewScanner(os.Stdin)
var (
	table, ans = [12][12]int{}, [12][12]int{}
)

func main() {
	scanner.Scan()
	n, _ := strconv.Atoi(scanner.Text())
	for i := 0; i < n; i++ {
		for j := 1; j < 11; j++ {
			scanner.Scan()
			input := strings.Split(scanner.Text(), " ")
			tmp := [10]int{}
			for k := range input {
				tmp[k], _ = strconv.Atoi(input[k])
			}
			for l := 1; l < 11; l++ {
				table[j][l] = tmp[l-1]
			}
		}
		check(table, 1, ans)
	}
}

func check(table [12][12]int, i int, ans [12][12]int) {
	if i == 11 {
		solve(table, 2, 1, ans)
		return
	}
	ans[1][i] = 0
	check(table, i+1, ans)
	ans[1][i] = 1
	attack(table, 1, i)
	check(table, i+1, ans)
	attack(table, 1, i)
}

func solve(table [12][12]int, i, j int, ans [12][12]int) {
	if i == 11 {
		flag := true
		for k := 1; k < 11; k++ {
			if table[10][k] == 1 {
				flag = false
				break
			}
		}
		if flag {
			printans(ans)
		}
		return
	}
	if table[i-1][j] == 1 {
		ans[i][j] = 1
		attack(table, i, j)
		if j == 10 {
			solve(table, i+1, 1, ans)
		} else {
			solve(table, i, j+1, ans)
		}
		attack(table, i, j)
		ans[i][j] = 0
	} else {
		ans[i][j] = 0
		if j == 10 {
			solve(table, i+1, 1, ans)
		} else {
			solve(table, i, j+1, ans)
		}
	}
}

func printans(ans [12][12]int) {
	for i := 1; i < 11; i++ {
		for j := 1; j < 11; j++ {
			fmt.Print(ans[i][j])
			if j < 10 {
				fmt.Print(" ")
			}
		}
		fmt.Println()
	}
}

func attack(table [12][12]int, i, j int) {
	table[i][j] = 1 - table[i][j]
	table[i-1][j] = 1 - table[i-1][j]
	table[i+1][j] = 1 - table[i+1][j]
	table[i][j-1] = 1 - table[i][j-1]
	table[i][j+1] = 1 - table[i][j+1]
}

C++: #include<iostream>
using namespace std;

bool grid[10][10];
int dy[] = {1,0,-1,0,0}, dx[] = {0,1,0,-1,0};

void rev(int y,int x){
  for(int i=0;i<5;i++){
    int sy = y+dy[i], sx = x+dx[i];
    if(sy<0 || sx<0 || sy>=10 || sx>=10)continue;
    grid[sy][sx] = !grid[sy][sx];
  }
}

int main(){
  int t;
  bool tmp[10][10];
  int ans[10][10];

  cin >> t;
  while(t--){
    for(int i=0;i<10;i++){
      for(int j=0;j<10;j++)cin >> tmp[i][j];
    }
    
    for(int i=0;i<(1<<10);i++){
      for(int j=0;j<10;j++){
	for(int k=0;k<10;k++)grid[j][k] = tmp[j][k];
      }

      for(int j=0;j<10;j++){
	if(i&(1<<j)){
	  rev(0,j);
	  ans[0][j] = 1;
	}else ans[0][j] = 0;
      }

      for(int j=1;j<10;j++){
	for(int k=0;k<10;k++){
	  if(grid[j-1][k]){
	    rev(j,k);
	    ans[j][k] = 1;
	  }else ans[j][k] = 0;
	}
      }

      bool f = false;
      for(int j=0;j<10;j++)f |= grid[9][j];
      if(!f)break;
    }

    for(int i=0;i<10;i++){
      for(int j=0;j<9;j++)cout << ans[i][j] << " ";
      cout << ans[i][9] << endl;
    }
  }
}

C++: #include<iostream>
#define MAX 12
#define INFTY 1 << 28
using namespace std;

bool IsLeft(int m[MAX][MAX]){
	for(int i = 1; i < MAX - 1; ++i){
		for(int j = 1; j < MAX - 1; ++j){
			if( m[i][j] ) return true;
		}
	}
	return false;
}
void PassParticle(int m[MAX][MAX], int i, int j){
	const int di[] = {0,-1,0,1,0};
	const int dj[] = {0,0,1,0,-1};

	for(int k = 0; k < sizeof(di)/sizeof(*di); ++k){
		m[i+di[k]][j+dj[k]] = (m[i+di[k]][j+dj[k]] + 1) % 2;
	}
}
void PrintMap(int m[MAX][MAX]){
	for(int i = 1; i < MAX - 1; ++i){
		cout << m[i][1];
		for(int j = 2; j < MAX - 1; ++j){
			cout << ' ' << m[i][j];
		}
		cout << '\n';
	}
}
int main(void){
	int n;

	cin >> n;
	for( int D = 0; D < n; ++D ){
		int pi, pj; /* 1ðÅà½­½]³¹çêéÀW */
		int M[MAX][MAX] = {{0,},};
		int Answer[MAX][MAX] = {{0,},};

		for(int i = 1; i < MAX - 1; ++i){
			for(int j = 1; j < MAX - 1 ; ++j){
				cin >> M[i][j];
			}
		}

		while( IsLeft(M) ){
			int max1 = 0;
			int min0 = INFTY;
			for(int i = 1; i < MAX - 1; ++i){
				for(int j = 1; j < MAX - 1 ; ++j){
					int cnt1 = 0;
					int cnt0 = 0;
					const int di[] = {-1,0,1,0};
					const int dj[] = {0,1,0,-1};

					for(int k = 0; k < sizeof(di)/sizeof(*di); ++k){
						if( M[i+di[k]][j+dj[k]] ) ++cnt1;
						else ++cnt0;
					}
					if( cnt1 > max1 && cnt0 < min0 )
					{
						pi = i; pj = j;
						max1 = cnt1;
						min0 = cnt0;
					}
				}
				
			}
			PassParticle( M, pi, pj );
			Answer[pi][pj] = 1;
		}
		PrintMap( Answer );
	}
	return 0;
}