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 <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){
        for(int roop=0; roop<n; roop++){
            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<<11 - 1); i++){
                memcpy(box2, box, sizeof(box));
                int l[12][12]={0};
                for(int j=1; j<=10; j++){
                    l[0][j]= (i>>(j-1))%2;
                    //cout<<l[0][j];
                }
                
                //cout<<endl;
                
                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<bits/stdc++.h>
using namespace std;

#define pb push_back
#define fr first
#define sc second
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<int,pii> pip; 
const int INF = (1<<25);
const int dx[]={0,0,0,1,-1},dy[]={-1,1,0,0,0};

int d[10][10], b[10][10], a[10][10];

void flip(int x, int y) {
  a[y][x]=1;
  for(int i=0; i<5; i++) {
    b[y+dy[i]][x+dx[i]] = 1-b[y+dy[i]][x+dx[i]];
  }
}

int main() {

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

    for(int i=0; i<1024; i++) {
      memset(a, 0, sizeof(a));
      memcpy(b, d, sizeof(d));
      for(int j=0; j<10; j++) {
	if((i>>j) & 1) flip(j, 0);
      }

      for(int j=1; j<10; j++) {
	for(int k=0; k<10; k++) {
	  if(b[j-1][k]) flip(k, j);
	}
      }

      int cnt=0;
      for(int j=0; j<10; j++) {
	cnt+=b[9][j];
      }

      if(cnt==0) break;
    }

    for(int i=0; i<10; i++) {
      for(int j=0; j<10; j++) {
	cout << a[i][j]<< (j==9 ? "" : " ");
      }
      cout<< endl;
    }
  }
}

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

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

using namespace std;

int f[10][10];
int dx[5] = {1,0,0,-1,0};
int dy[5] = {0,1,0,0,-1};
vector<pair<int,int> > ans;

void change(int y,int x)
{
	if(f[y-1][x] == 1)
	{
		ans.push_back(make_pair(y,x));
		rep(i,5)
		{
			int ny = y + dy[i];
			int nx = x + dx[i];

			if(0 <= nx && nx < 10 && 0 <= ny && ny < 10)
			{
				if(f[ny][nx] == 1) f[ny][nx] = 0;
				else f[ny][nx] = 1;
			}
		}
	}
}

void dfs(int y,int x)
{
	//cout << "y:" << y << " x:" << x << endl;
	ans.clear();
	rep(i,10)
	{
		rep(j,10)
		{
			if(i == y)
			{
				if(j >= x)
				{
					change(i,j);
				}
			}
			else if(i > y)
			{
				change(i,j);	
			}
		}
	}
	int cnt = 0;
	rep(i,10) rep(j,10) if(f[i][j] == 1) cnt++;

	if(cnt == 0) return;
	else
	{
		if(y == 9)
		{
			return;
		}
		else if(x < 9)
		{
			dfs(y,x+1);
		}
		else if(x == 9)
		{
			dfs(y+1,0);
		}
	}
}

int main()
{
	int n;
	cin >> n;

	rep(i,n)
	{
		memset(f,0,sizeof(f));

		rep(j,10)
		{
			rep(k,10)
			{
				cin >> f[j][k];
			}
		}
		
		dfs(1,0);

		bool p[10][10];
		rep(j,10) rep(k,10) p[j][k] = false;

		rep(j,ans.size())
		{
			p[ans[j].first][ans[j].second] = true;
		}
		
		rep(j,10)
		{
			rep(k,10)
			{
				if(p[j][k]) cout << 1;
				else cout << 0;

				if(k == 9) cout << endl;
				else cout << " ";
			}
		}
	}
	return 0;
}

C++: #include <iostream>
#include <string.h>
using namespace std;
int dx[]={-1,0,1,0,0};
int dy[]={0,-1,0,1,0};

int main() {
	int n ; cin >> n ;
	while(n--){
		int field[10][10];
		for(int i=0;i<10;i++) for(int j=0;j<10;j++) cin >> field[i][j];
		int tmp_ans[10][10]={0};
		int tmp_field[10][10];
		for(int i=0;i<1<<10;i++){
			bool failed=false;
			memset(tmp_ans,0,sizeof(tmp_ans));
			memcpy(tmp_field,field,sizeof(field));
			for(int j=0;j<10;j++) tmp_ans[0][10-1-j]= i>>j & 1;
			for(int j=0;j<10;j++){
				if(tmp_ans[0][j]){
					for(int m=0;m<=4;m++)
						if(0<=j+dx[m] && j+dx[m]<10 && 0<=dy[m] ) (tmp_field[dy[m]][j+dx[m]])^=1;
				}
			}
			for(int l=1;l<10;l++){
				for(int k=0;k<10;k++){
					if(tmp_field[l-1][k]){
						tmp_ans[l][k]=true;
						for(int m=0;m<=4;m++)
							if(0<=k+dx[m] && k+dx[m]<10 && 0<=l+dy[m] && l+dy[m]<10) tmp_field[l+dy[m]][k+dx[m]]^=1;
					}
				}
			}
			for(int j=0;j<10;j++) if(tmp_field[9][j]) failed=true;
			if(!failed) break;
		}
		for(int i=0;i<10;i++){
			for(int j=0;j<10;j++) {if(j) cout << ' ' ; cout << tmp_ans[i][j] ;}
			cout << '\n' ;	
		}
	}
}