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 <bits/stdc++.h>
 
using namespace std;
 
const int dx[5] = {-1, 0, 0, 0, 1};
const int dy[5] = {0, -1, 0, 1, 0};
 
int arr[10][10];
int ans[10][10], flip[10][10];
 
int get(int x, int y)
{
    int c = arr[x][y];
    for (int d = 0; d < 5; d++) {
	int x2 = x + dx[d], y2 = y + dy[d];
	if (0 <= x2 && x2 < 10 && 0 <= y2 && y2 < 10) {
	    c += flip[x2][y2];
	}
    }
    return c % 2;
}
 
int calc()
{
    for (int i = 1; i < 10; i++) {
	for(int j = 0; j < 10; j++) {
	    if (get(i-1, j) != 0) {
		flip[i][j] = 1;
	    }
	}
    }
 
    for (int j = 0; j < 10; j++) {
	if (get(9, j) != 0) {
	    return -1;
	}
    }
 
    int res = 0;
    for (int i = 0; i < 10; i++) {
	for (int j = 0; j < 10; j++) {
	    res += flip[i][j];
	}
    }
    return res;
}
 
void solve()
{
    int res = -1;
 
    for (int i = 0; i < (1<<10); i++) { 
	memset(flip, 0, sizeof(flip));
	for (int j = 0; j < 10; j++) {
	    flip[0][10-j-1] = i >> j & 1;
	}
	int num = calc();
	if (num >= 0 && (res < 0 || res > num)) {
	    res = num;
	    memcpy(ans, flip, sizeof(ans));   
	}
    }
 
    for (int i = 0; i < 10; i++) {
	for (int j = 0; j < 10; j++) {
	    printf("%d%c", ans[i][j], j+1 == 10 ? '\n' : ' ');
	}
    }
}
 
int main()
{
    int Tc;
    cin >> Tc;
    while (Tc--) {
	for (int i = 0; i < 10; i++) {
	    for (int j = 0; j < 10; j++) {
		cin >> arr[i][j];
	    }
	}
	solve();
    }
    return 0;
}

C++: #include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#include<cstring>

#define MAX 12

using namespace std;

class CMap{
public:
	int m[MAX][MAX];
	vector< pair<int, int> > vHist;

	CMap()
	{
		for(int i = 0; i < MAX; ++i)
			for(int j = 0; j < MAX; ++j)
				m[i][j] = 0;
	}

	void PassParticle(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;

		vHist.push_back( make_pair( i, j ) );
	}

	bool NoLight() const
	{
		for(int i = 1; i < MAX - 1; ++i)
			for(int j = 1; j < MAX - 1; ++j)
				if( m[i][j] ) return false;
		return true;
	}

	void Print() const
	{
		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';
		}
	}

	void PrintAns() const
	{
		int a[MAX][MAX] = {{0,},};
		for( unsigned int i = 0; i < vHist.size(); ++i)
			a[vHist[i].first][vHist[i].second] = 1;

		for(int i = 1; i < MAX - 1; ++i){
			cout << a[i][1];
			for(int j = 2; j < MAX - 1; ++j)
				cout << ' ' << a[i][j];
			cout << '\n';
		}
	}
	
	bool operator==(const CMap &t) const
	{
		for(int i = 1; i < MAX - 1; ++i)
			for(int j = 1; j < MAX - 1; ++j)
				if( t.m[i][j] != m[i][j] )
					return false;
		return true;
	}
};
void BFS(CMap &stm, CMap &ret){
	vector< CMap > q;

	q.push_back( stm );

	while( !q.empty() ){
		CMap M = q[0];
		q.erase( q.begin() );

		if( M.NoLight() )
		{
			ret = M;
			break;
		}

		for(int i = 1; i < MAX - 1; ++i){
			for(int j = 1; j < MAX - 1 ; ++j){
				CMap add;
				int cnt1 = 0;
				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)
					if( M.m[i+di[k]][j+dj[k]] )
						++cnt1;

				if( cnt1 >= 3 )
				{
					add = M;
					add.PassParticle( i, j );
					if( q.end() == find( q.begin(), q.end(), add ) )
						q.push_back( add );
				}
			}
		}
	}
}
int main(void){
	int n;

	cin >> n;
	for( int D = 0; D < n; ++D )
	{
		CMap M;
		CMap Answer;

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

		BFS( M, Answer );

		Answer.PrintAns();
	}
	return 0;
}

C++: #include<stdio.h>
#include<iostream>
#include<climits>
using namespace std;
#define SIZE 100

class ExtendedLightsOut{
 public:
  char M[SIZE], P[SIZE], A[SIZE];
  bool solved;
  int min_value;

  bool check(){
    for ( int i = 0; i < SIZE; i++ ) if ( M[i] == '1' ) return false;
    return true;
  }

  void flipM( int pos ){ M[pos] = ( M[pos] == '0' ) ? '1' : '0'; }
  void flipP( int pos ){ P[pos] = ( P[pos] == '0' ) ? '1' : '0'; }

  void press( int pos ){
    int x, y, nx, ny;
    x = pos / 10;
    y = pos % 10;

    flipM( pos );
    flipP( pos );

    nx = x + 1;
    ny = y;
    if ( 0 <= nx && 0 <= ny && nx < 10 && ny < 10 ) flipM( nx*10 + ny );

    nx = x;
    ny = y + 1;
    if ( 0 <= nx && 0 <= ny && nx < 10 && ny < 10 ) flipM( nx*10 + ny );

    nx = x - 1;
    ny = y;
    if ( 0 <= nx && 0 <= ny && nx < 10 && ny < 10 ) flipM( nx*10 + ny );

    nx = x;
    ny = y - 1;
    if ( 0 <= nx && 0 <= ny && nx < 10 && ny < 10 ) flipM( nx*10 + ny );

  }

  bool recursive( int pos ){
    if ( pos == SIZE ) return check();

    if ( pos < 10 ){
      if ( recursive( pos + 1 ) ) return true;
      press( pos );
      if ( recursive( pos + 1 ) ) return true;
      press( pos );
    } else {
      int p = pos - 20;
      if ( p > 0 && M[p] == '1' ) return false;
      int v = pos - 10;
      if ( M[v] == '1' ) {
	press( pos );
	if ( recursive( pos + 1 ) ) return true;
	press( pos );
      } else {
	if ( recursive( pos + 1 ) ) return true;
      }
    }
    return false;
  }

  void print(){
    for ( int i = 0; i < 10; i++ ){
      for ( int j = 0; j < 10; j++ ){
	if ( j ) printf(" ");
	printf("%c", P[i*10+j] );
      }
      printf("\n");
    }
  }

  void work(){
    for ( int i = 0; i < SIZE; i++ ){
	P[i] = '0';
    }
    solved = false;
    min_value = INT_MAX;
    if ( recursive( 0 ) ){
      print();
    }else{
      cout << "NO SOLUTION" << endl;
    }
  }

  void read(){
    for ( int i = 0; i < SIZE; i++ ){
      cin >> M[i];
    }
  }
};

main(){
  ExtendedLightsOut ELO;
  int tcase;
  cin >> tcase;
  for ( int i = 1; i <= tcase; i++ ){
    ELO.read();
    ELO.work();
  }
}