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>
#include <algorithm>
using namespace std;

const int H = 10;
const int W = 10;
int G[H][W];
int ans[H][W];

void put(int i, int j) {
  const static int di[5] = {0,1,0,-1,0};
  const static int dj[5] = {1,0,-1,0,0};
  for(int k = 0; k < 5; ++k) {
    int ni = i + di[k];
    int nj = j + dj[k];
    if(ni < 0 || ni >= H) continue;
    if(nj < 0 || nj >= W) continue;
    G[ni][nj] ^= 1;
  }
}

bool rec(int i, int j) {
  if(j == W) {
    ++i;
    j = 0;
  }

  if(i == H) {
    for(int j = 0; j < W; ++j) {
      if(G[H-1][j]) return false;
    }
    return true;
  }

  if(i == 0) {
    ans[i][j] = 0;
    if(rec(i, j+1)) return true;
    ans[i][j] = 1;
    put(i, j);
    if(rec(i, j+1)) return true;
    put(i, j);
  } else {
    if(G[i-1][j]) {
      ans[i][j] = 1;
      put(i, j);
      if(rec(i, j+1)) return true;
      put(i, j);
    } else {
      ans[i][j] = 0;
      if(rec(i, j+1)) return true;
    }
  }
  return false;
}

int main() {
  int n;
  cin >> n;
  while(n--) {
    for(int i = 0; i < H; ++i) {
      for(int j = 0; j < W; ++j) {
        cin >> G[i][j];
      }
    }
    rec(0, 0);
    for(int i = 0; i < H; ++i) {
      for(int j = 0; j < W; ++j) {
        if(j) cout << " ";
        cout << ans[i][j];
      }
      cout << endl;
    }
  }
  return 0;
}

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

int board[12][12];
int used[12][12];

bool lastCheck(){
	for(int y=0;y<10;y++){
		for(int x=0;x<10;x++){
			if(board[y][x])return false;
		}
	}
	return true;
}

bool canPut(int y, int x){
	int sy = y - 1;
	int ty = y + 1;
	int sx = x - 1;
	int tx = x + 1;
	if(sy < 0 || ty >= 10 || sx < 0 || tx >= 10)return false;
	return true;
}

bool allow(int n){
	for(int i=0;i<n;i++){
		int y = i / 10;
		int x = i % 10;

		if(board[y][x] == 0)continue;

		bool ok = false;
		for(int j=n;j<100;j++){
			int ny = j / 10;
			int nx = j % 10;

			int dy = abs(ny - y);
			int dx = abs(nx - x);

			if(dy >= 2)break;
			if(dy + dx <= 1 && canPut(ny, nx)){
				ok = true;
				break;
			}
		}

		if(!ok)return false;
	}
	return true;
}

int pattern[] = {
    0,1,0,
    1,1,1,
    0,1,0
};

void flip(int y, int x){
	int sy = y - 1;
	int sx = x - 1;
	for(int i=0;i<3;i++)for(int j=0;j<3;j++){
		int ny = sy + i;
		int nx = sx + j;
		if(pattern[i*3+j]){
			board[ny][nx] ^= 1;
		}
	}
}

bool dfs(int n){
	if(n >= 10 * 10){
		return lastCheck();
	}
	if(!allow(n)){
		return false;
	}
	int y = n / 10;
	int x = n % 10;

	if(!canPut(y, x)){
		return dfs(n + 1);
	}

	if(dfs(n + 1)){
		return true;
	}

	flip(y, x);
	used[y][x] = 1;

	if(dfs(n + 1))return true;
	
	used[y][x] = 0;
	flip(y, x);

	return false;
}

void solve(){
	memset(used, 0, sizeof(used));
	dfs(0);
}
int main()
{
	int n;
	cin >> n;

	for(int t=0;t<n;t++){
		for(int y=0;y<10;y++){
			for(int x=0;x<10;x++)cin >> board[y][x];
		}
		solve();
		for(int y=0;y<10;y++){
			for(int x=0;x<10;x++){
				cout << used[y][x] << " ";
			}
			cout << endl;
		}
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int I,flg;
int t[10][10],u[10][10];
int ans[10][10];
void check();
void dfs(int);
void compute(int,int);
int main(){
  cin>>I;
  while(I--){
    flg=0;
    for(int i=0;i<10;i++){
      for(int j=0;j<10;j++){
	cin>>t[i][j];
	u[i][j]=t[i][j];
	ans[i][j]=0;
      }
    }
    dfs(0);
  }
  return 0;
}


void dfs(int x){
  if(flg)return;
  if(x==10)check();
  ans[0][x]=0;
  dfs(x+1);
  ans[0][x]=1;
  dfs(x+1);
}


void check(){
  if(flg)return;
  for(int i=0;i<10;i++)for(int j=0;j<10;j++)t[i][j]=u[i][j];
  for(int i=0;i<10;i++)if(ans[0][i])compute(0,i);
  for(int i=1;i<10;i++){
    for(int j=0;j<10;j++){
      if(t[i-1][j]==1){
	ans[i][j]=1;
	compute(i,j);
      }
    }
  }
  int cnt=0;
  for(int i=0;i<10;i++)cnt+=t[9][i];
  if(cnt==0){
    flg=1;
    for(int i=0;i<10;i++){
      for(int j=0;j<10;j++){
	if(j)cout<<' ';
	cout<<ans[i][j];
      }
      cout<<endl;
    }
  }
}

void compute(int y,int x){
  t[y][x]=!t[y][x];
  if(y>0)t[y-1][x]=!t[y-1][x];
  if(x>0)t[y][x-1]=!t[y][x-1];
  if(y<9)t[y+1][x]=!t[y+1][x];
  if(x<9)t[y][x+1]=!t[y][x+1];
}

C++: #include<cstdio>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

int main(){
	int S3[1024];
	rep(S,1024){
		int stat=0;
		rep(j,10) if(S&(1<<j)) {
			stat^=1<<j;
			if(j>0) stat^=1<<(j-1);
			if(j<9) stat^=1<<(j+1);
		}
		S3[S]=stat;
	}

	int T; scanf("%d",&T);
	while(T--){
		int org[10]={};
		rep(i,10) rep(j,10) {
			int tmp; scanf("%d",&tmp);
			org[i]|=tmp<<j;
		}

		int ans;
		rep(S,1024){
			int grid[10];
			rep(i,10) grid[i]=org[i];

			grid[0]^=S3[S];
			grid[1]^=S;
			for(int i=1;i<10;i++){
				int pttn=grid[i-1];
				grid[i-1]=0;
				grid[i]^=S3[pttn];
				if(i<10) grid[i+1]^=pttn;
			}

			if(grid[9]==0){ ans=S; break; }
		}

		rep(j,10) printf("%d%c",!!(ans&(1<<j)),j<9?' ':'\n');
		org[0]^=S3[ans];
		org[1]^=ans;
		for(int i=1;i<10;i++){
			int pttn=org[i-1];
			org[i-1]=0;
			org[i]^=S3[pttn];
			if(i<10) org[i+1]^=pttn;
			rep(j,10) printf("%d%c",!!(pttn&(1<<j)),j<9?' ':'\n');
		}
	}

	return 0;
}