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;
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();
  }else{
    ans[0][x]=0;
    dfs(x+1);
    if(flg)return;
    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]==1)compute(0,i);
  
  for(int i=1;i<10;i++){
    for(int j=0;j<10;j++){
      ans[i][j]=0;
      if(t[i-1][j]==1){
	ans[i][j]=1;
	compute(i,j);
      }
    }
  }
  /*
  for(int i=0;i<10;i++){
    for(int j=0;j<10;j++){
      if(j)cout<<' ';
      cout<<t[i][j];
    }
    cout<<endl;
  }
  */
  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]*-1)+1;
  if(y>0)t[y-1][x]=(t[y-1][x]*-1)+1;
  if(x>0)t[y][x-1]=(t[y][x-1]*-1)+1;
  if(y<9)t[y+1][x]=(t[y+1][x]*-1)+1;
  if(x<9)t[y][x+1]=(t[y][x+1]*-1)+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<10) 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;
}

C++: #include <iostream>

using namespace std;

int main() {
    int n;
    cin >> n;
    int state[10][10];
    int ans[10][10];
    while (n --) {
        memset(state, 0, sizeof(state));
        memset(ans, 0, sizeof(ans));
        for (int i=0; i<10; ++i) {
            for (int j=0; j<10; ++j) {
                cin >> state[i][j];
            }
        }
        for (int i=0; i<10; ++i) {
            for (int j=0; j<10; ++j) {
                if (state[i][j] == 1) {
                    state[i][j]     = 1 - state[i][j];
                    state[i+1][j-1] = 1 - state[i+1][j-1];
                    state[i+1][j]   = 1 - state[i+1][j];
                    state[i+1][j+1] = 1 - state[i+1][j+1];
                    state[i+2][j]   = 1 - state[i+2][j];
                    ans[i+1][j] = 1;
                }
            }
        }
        for (int i=0; i<10; ++i) {
            for (int j=0; j<10; ++j) {
                cout << (j == 0 ? "" : " ") << ans[i][j];
            }
            cout << endl;
        }
    }
    return 0;
}

C++: #include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<complex>
#include<cmath>
#include<algorithm>
#include<map>
#include<vector>
#include<sstream>
#include<iostream>
using namespace std;
int field[10][10];
bool greed(string top){
    int a[10][10];
    int ans[10][10];
    for(int i = 0;i < 10;i++){
        for(int j = 0;j < 10;j++){
            ans[i][j] = 0;
        }
    }
    for(int i = 0;i < 10;i++){
        for(int j = 0;j < 10;j++){
            a[i][j] = field[i][j];
        }
    }
    for(int j = 0;j < 10;j++){
        if(top[j]=='1'){
            ans[0][j] = 1;
            a[0][j] = 1 - a[0][j];
            if(j!=0)a[0][j-1] = 1 - a[0][j-1];
            if(j!=9)a[0][j+1] = 1 - a[0][j+1];
            a[1][j] = 1 - a[1][j];
        }
    }
    for(int i = 1;i < 10;i++){
        for(int j = 0;j < 10;j++){
            if(a[i-1][j]==1){
                ans[i][j] = 1;
                a[i][j] = 1 - a[i][j];
                if(i!=9)a[i+1][j] = 1 - a[i+1][j];
                if(j!=9)a[i][j+1] = 1 - a[i][j+1];
                if(i!=0)a[i-1][j] = 1 - a[i-1][j];
                if(j!=0)a[i][j-1] = 1 - a[i][j-1];
            }
        }
    }
    bool flg = false;
    for(int j = 0;j < 10;j++){
        if(a[9][j]==1){
            flg = true;
            break;
        }
    }
    if(!flg){
        for(int i = 0;i < 10;i++){
            cout<<ans[i][0];
            for(int j = 1;j < 10;j++){
                cout<<" "<<ans[i][j];
            }
            cout<<endl;
        }
        return true;
    }
    else return false;
}
int cnt;

void perm(int dep,string top){
    if(dep == 10){
        greed(top);

        return;
    }
    perm(dep + 1,top);
    top[dep] = '1';
    perm(dep + 1,top);
}
int main(void){

    int n;
    cin>>n;
    while(n--){
        for(int i = 0;i < 10;i++)
            for(int j = 0;j < 10;j++)
                cin>>field[i][j];

        perm(0,"0000000000");
    }


    return 0;
}