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]
}

Python: def attack(table, i, j):
    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]

def printans(ans):
    for i in range(1, 11):
        for j in range(1, 11):
            print(ans[i][j], end="")
            if j < 10:
                print(" ", end="")
        print("")

def solve(table, i, j, ans):

    #print(i,j)
    if i == 11:
        flag = True
        for k in range(1,11):
            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)


def check(table, i, ans):

    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)

N = int(input())

for l in range(N):
    table= [[0 for i in range(12)] for j in range(12)]
    ans= [[0 for i in range(12)] for j in range(12)]
    for i in range(1, 11):
        nums = [int(k) for k in input().split()]
        for j in range(1, 11):
            table[i][j] = nums[j-1]

    check(table, 1, ans)

Python: from itertools import product

def upd(line, fix):
  for i, v in enumerate(fix):
   if v:
     if i == 0:
       line[i] = not line[i]
       line[i + 1] = not line[i + 1]
     elif i == 9:
       line[i - 1] = not line[i - 1]
       line[i] = not line[i]
     else:
       line[i - 1] = not line[i - 1]
       line[i] = not line[i]
       line[i + 1] = not line[i + 1]
  return list(map(int, line))

def upd2(line, fix):
  return [int(i != j) for i, j in zip(line, fix)]

n = int(input())
for _ in range(n):
  base_mp = [list(map(int, input().split())) for _ in range(10)]
  for first_row in product([0, 1], repeat=10):
    mp = [list(first_row)] + [[i for i in base_mp[j]] for j in range(10)]
    save = []
    for i in range(10):
      save.append(mp[i])
      mp[i + 1] = upd(mp[i + 1], mp[i])
      if i == 9:continue
      mp[i + 2] = upd2(mp[i + 2], mp[i])
    
    if not any(mp[10]):
      for line in save:
        print(*line)
      break

C++: #include<cstdio>
#include<cstring>

int n;
int fie[13][13];
int now[13][13];
int res[13][13];

void flip(int x,int y){
	fie[x][y]=1-fie[x][y];
	fie[x][y+1]=1-fie[x][y+1];
	fie[x][y-1]=1-fie[x][y-1];
	fie[x+1][y]=1-fie[x+1][y];
	fie[x-1][y]=1-fie[x-1][y];
}

void check(int x,int y){
	if(x==10 && y==10){
		int flag=0;
		for(int i=1;i<=10;i++){
			for(int j=1;j<=10;j++)if(fie[j][i]==1)flag=1;
		}
		if(flag==0){
			for(int i=1;i<=10;i++){
				for(int j=1;j<=10;j++)res[j][i]=now[j][i];
			}
		}
		return;
	}
	if(y==1){
		now[x][y]=0;
		if(x<=9)check(x+1,y);
		else check(0,y+1);
		
		flip(x,y);
		now[x][y]=1;
		if(x<=9)check(x+1,y);
		else check(0,y+1);
		flip(x,y);
		
	}else{
		if(fie[x][y-1]==1){
			flip(x,y);
			now[x][y]=1;
			if(x<=9)check(x+1,y);
			else check(0,y+1);
			flip(x,y);
		}else{
			now[x][y]=0;
			if(x<=9)check(x+1,y);
			else check(0,y+1);
		}
	}
}

int main(void){
	scanf("%d",&n);
	for(int kkk=0;kkk<n;kkk++){
		for(int i=1;i<=10;i++){
			for(int j=1;j<=10;j++)scanf("%d",&fie[j][i]);
		}
		memset(now,0,sizeof(now));
		memset(res,-1,sizeof(res));
		check(1,1);
		for(int i=1;i<=10;i++){
			for(int j=1;j<=10;j++)printf("%d%c",res[j][i],j==10?'\n':' ');
		}
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;


void mark(int mp[10][10],int y,int x){
  int dx[]={0,0,1,-1},dy[]={1,-1,0,0};
  for(int i=0;i<4;i++) {
    int nx=x+dx[i],ny=y+dy[i];
    if(nx<0||ny<0||nx>=10||ny>=10)continue;
    mp[ny][nx]=!mp[ny][nx];
  }
  mp[y][x]=!mp[y][x];
}

bool check(int mp[10][10]){
  for(int i=0;i<10;i++)
    for(int j=0;j<10;j++)if(mp[i][j])return 0;
  return 1;
}

int main(){
  int q;
  cin>>q;
  while(q--){

    int mp[10][10];
    for(int i=0;i<10;i++)for(int j=0;j<10;j++)cin>>mp[i][j];

    int ans[10][10];
    for(int i=0;i<(1<<10)&&!check(mp);i++){
      for(int j=0;j<10;j++)ans[0][i]=(1&(1<<j));
      for(int j=1;j<10;j++)
	for(int k=0;k<10;k++)
	  if((ans[j][k]=mp[j-1][k]))mark(mp,j,k);
    }

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

  }

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;


void mark(int mp[10][10],int y,int x){
  int dx[]={0,0,1,-1},dy[]={1,-1,0,0};
  for(int i=0;i<4;i++) {
    int nx=x+dx[i],ny=y+dy[i];
    if(nx<0||ny<0||nx>=10||ny>=10)continue;
    mp[ny][nx]=!mp[ny][nx];
  }
  mp[y][x]=!mp[y][x];
}

bool check(int mp[10][10]){
  for(int i=0;i<10;i++)
    for(int j=0;j<10;j++)if(mp[i][j])return 0;
  return 1;
}

int main(){
  int q;
  cin>>q;
  while(q--){
    int mp[10][10];
    for(int i=0;i<10;i++)for(int j=0;j<10;j++)cin>>mp[i][j];

    int ans[10][10]={};
    for(int i=0;i<(1<<10)&&!check(mp);i++){
      for(int j=0;j<10;j++)if((ans[0][j]=(i&(1<<j))))mark(mp,0,j);

      for(int j=1;j<10;j++)
	for(int k=0;k<10;k++)
	  if((ans[j][k]=mp[j-1][k]))mark(mp,j,k);
    }

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

  }

  return 0;
}