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 <vector>
#include <iostream>
#include <list>

std::list<int> dfs(std::vector<std::vector<bool>> &state, const int &idx = 1) {
	if (idx < 10) {
		int res = 0;
		for (auto i = 0; i < 10; ++i) {
			res <<= 1;
			if (state.at(idx - 1).at(i)) {
				res += 1;
				for (const auto &index : { i - 1, i, i + 1 }) {
					if (index >= 0 && index < 10) {
						state.at(idx).at(index) = !state.at(idx).at(index);
					}
				}
				if (idx != 9) {
					state.at(idx + 1).at(i) = !state.at(idx + 1).at(i);
				}
			}
		}
		auto list = dfs(state, idx + 1);
		if (list.size() + idx == 9) {
			list.push_front(res);
			return list;
		}
		else {
			return list;
		}
	}
	else {
		bool is_on = false;
		for (const auto &cell : state.at(9)) {
			is_on = is_on || cell;
		}
		if (is_on) {
			return std::list<int>{0};
		}
		else {
			return std::list<int>{};
		}
	}
}
std::list<int> solve(std::vector<std::vector<bool>> &state) {
	for (auto i = 0; i < 1023; ++i) {
		auto copy = state;
		for (auto j = 0; j < 10; ++j) {
			if ((i & (1 << j)) != 0) {
				for (const auto &idx : { j - 1, j, j + 1 }) {
					if (idx >= 0 && idx < 10) {
						copy.at(0).at(idx) = !copy.at(0).at(idx);
					}
				}
				copy.at(1).at(j) = !copy.at(1).at(j);
			}
		}
		auto list = dfs(copy);
		if (list.size() == 9) {
			list.push_front(i);
			return list;
		}
	}
	return std::list<int>{};
}
int main() {
	int n;
	for (std::cin >> n; n > 0; --n) {
		std::vector<std::vector<bool>> state(10, std::vector<bool>(10, false));
		bool input;
		for (auto &line : state) {
			for (auto i = 0; i < 10; ++i) {
				std::cin >> input;
				line.at(i) = input;
			}
		}
		auto res = solve(state);
		for (const auto &line : res) {
			for (auto i = 512; i > 0; i >>= 1) {
				std::cout << static_cast<int>((i & (line)) != 0) << ((i != 1) ? ' ' : '\n');
			}
		}
	}
	return 0;
}

C++: #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <fstream>
#include <sstream>
#include <math.h>
#include <queue>
#include <stack>
#include <math.h>
#include <string.h>


using namespace std;


void f(bool box[12][12]){
    for(int i=1; i<=10; i++){
        for(int j=1; j<=10; j++){
            cout<<box[i][j];
        }
        cout<<endl;
    }
    cout<<endl;
}

int main(){
    int n;
    while(cin>>n){
        
        bool box[12][12]={0};
        
        for(int i=1; i<=10; i++){
            for(int j=1; j<=10; j++){
                cin>>box[i][j];
            }
        }
        //cout<<"----------------------"<<endl;
        
        bool box2[12][12]={0};

        for(int i=0; i<(1<<10 - 1); i++){
            memcpy(box2, box, sizeof(box));
            int l[12][12]={0};
            for(int j=1; j<=10; j++){
                l[0][j]= (i>>j)%2;
            }
            
            for(int j=1; j<=10; j++){
                for(int k=1; k<=10; k++){
                    if(l[j-1][k]==1){
                        box2[j][k]=(box2[j][k]+1)%2;
                        box2[j][k+1]=(box2[j][k+1]+1)%2;
                        box2[j][k-1]=(box2[j][k-1]+1)%2;
                        box2[j-1][k]=(box2[j-1][k]+1)%2;
                        box2[j+1][k]=(box2[j+1][k]+1)%2;
                    }
                }
                
                for(int k=1; k<=10; k++){
                    l[j][k]=box2[j][k];
                }
            }
            
            bool end_flag=true;
            for(int i=1; i<=10; i++){
                if(l[10][i]==1){
                    end_flag=false;
                    break;
                }
            }
            
            
            if(end_flag){
                for(int i=0; i<=9; i++){
                    for(int j=1; j<=10; j++){
                        cout<<l[i][j];
                        if(j==10)break;
                        cout<<" ";
                    }
                    cout<<endl;
                }
                break;
            }
        }
        //cout<<"============================"<<endl;

        
        
    }
}

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

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)

const int INF = 1001001001;

int N;
int map[12][12];

int main(){
    std::cin >> N;

    REP(_, N){
        FOR(i, 1, 11){
            FOR(j, 1, 11){
                std::cin >> map[i][j];
            }
        }

        FOR(i, 1, 11){
            FOR(j, 1, 11){
                if(map[i-1][j] == 1 && map[i][j-1] == 1){
                    printf("1");
                    map[i][j] = !map[i][j];
                    map[i+1][j] = !map[i+1][j];
                    map[i][j+1] = !map[i][j+1];
                }else{
                    printf("0");
                }
                
                if(j < 10){printf(" ");}
                else{puts("");}
            }
        }
    }
}

C++: #include<iostream>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
const int dx[4] = {0,1,0,-1};
const int dy[4] = {1,0,-1,0};

int main(){
  int n;
  cin >> n;
  
  while(n-- > 0){
    int imap[11][11],syokurin[11][11],solve[11][11];
    rep(i,10){
      rep(j,10){
	syokurin[i][j] = solve[i][j] = 0;
	cin >> imap[i][j];
      }
    }

    while(true)
      {
	rep(i,10){
	  rep(j,10){
	    if(imap[i][j] == 0)continue;
	    syokurin[i][j]++;
	    rep(k,4){
	      int nx = j+dx[k],ny = i+dy[k];
	      if(!(0<=nx && nx <10 && 0<=ny && ny <10))continue;
	      syokurin[ny][nx]++;
	    }
	  }
	}	

	rep(i,10){
	  rep(j,10){
	    if(syokurin[i][j] == 1)continue;
	    if(syokurin[i][j]%2 != 0 && solve[i][j] != 1){
	      solve[i][j] = 1;
	      imap[i][j] = imap[i][j] == 0?1:0;
	      rep(k,4){
		int nx = j+dx[k],ny = i+dy[k];
		if(!(0<=nx && nx <10 && 0<=ny && ny <10))continue;
		imap[ny][nx] = imap[ny][nx]==0?1:0;
	      }
	    }
	  }
	}

	rep(i,10)rep(j,10)syokurin[i][j] = 0;
	bool fin = true;
	rep(i,10)rep(j,10)if(imap[i][j] == 1)fin = false;
	  if(fin)break;
      }

    rep(i,10){
      rep(j,10){
	cout << solve[i][j];
	if(j != 9)cout << " ";
      }
      cout << endl;
    }
    
  }
  return 0;
}