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 <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 temp[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(temp[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(temp[ny][nx] == 1) temp[ny][nx] = 0;
				else temp[ny][nx] = 1;
			}
		}
	}
}
void dfs(int y,int x)
{
	rep(i,10) rep(j,10) temp[i][j] = f[i][j];
	ans.clear();
	REP(i,1,9)
	{
		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(temp[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));
		memset(temp,0,sizeof(temp));

		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<vector>
#include<list>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int f(int p[][12],int q[][12],int x){
  int i,j;
  int r[12][12],s[12][12];
  if(x==11){
    for(i=2;i<10;i++){
      for(j=1;j<11;j++){
	if(p[j][i]){
	  p[j  ][i  ]=(p[j  ][i  ]+1)%2;
	  p[j-1][i+1]=(p[j-1][i+1]+1)%2;
	  p[j  ][i+1]=(p[j  ][i+1]+1)%2;
	  p[j+1][i+1]=(p[j+1][i+1]+1)%2;
	  p[j  ][i+2]=(p[j  ][i+2]+1)%2;
	  q[j][i+1]=1;
	}
      }
    }
    for(i=1;i<11;i++){
      if(p[i][10])
	break;
    }
    if(i==11){
      for(i=1;i<11;i++){
	for(j=1;j<10;j++)
	  cout<<q[j][i]<<" ";
	cout<<q[j][i]<<endl;
      }
      return 1;
    }
  }else if(x==10){
    if(p[x][1]){
      memcpy(r,p,sizeof(r));
      memcpy(s,q,sizeof(s));
      r[x  ][1]=(r[x  ][1]+1)%2;
      r[x-1][2]=(r[x-1][2]+1)%2;
      r[x  ][2]=(r[x  ][2]+1)%2;
      r[x+1][2]=(r[x+1][2]+1)%2;
      r[x  ][3]=(r[x  ][3]+1)%2;
      s[x  ][2]=1;
      if(f(r,s,x+1))
	return 1;
    }else{
      memcpy(r,p,sizeof(r));
      memcpy(s,q,sizeof(s));
      if(f(r,s,x+1))
	return 1;
    }
  }else{
      if(p[x][1]){
      memcpy(r,p,sizeof(r));
      memcpy(s,q,sizeof(s));
      r[x+1][0]=(r[x+1][0]+1)%2;
      r[x  ][1]=(r[x  ][1]+1)%2;
      r[x+1][1]=(r[x+1][1]+1)%2;
      r[x+2][1]=(r[x+2][1]+1)%2;
      r[x+1][2]=(r[x+1][2]+1)%2;
      s[x+1][1]=1;
      if(f(r,s,x+1))
	return 1;
      memcpy(r,p,sizeof(r));
      memcpy(s,q,sizeof(s));
      r[x  ][1]=(r[x  ][1]+1)%2;
      r[x-1][2]=(r[x-1][2]+1)%2;
      r[x  ][2]=(r[x  ][2]+1)%2;
      r[x+1][2]=(r[x+1][2]+1)%2;
      r[x  ][3]=(r[x  ][3]+1)%2;
      s[x  ][2]=1;
      if(f(r,s,x+1))
	return 1;
    }else{
      memcpy(r,p,sizeof(r));
      memcpy(s,q,sizeof(s));
      if(f(r,s,x+1))
	return 1;
      memcpy(r,p,sizeof(r));
      memcpy(s,q,sizeof(s));
      r[x+1][0]=(r[x+1][0]+1)%2;
      r[x  ][1]=(r[x  ][1]+1)%2;
      r[x+1][1]=(r[x+1][1]+1)%2;
      r[x+2][1]=(r[x+2][1]+1)%2;
      r[x+1][2]=(r[x+1][2]+1)%2;
      s[x+1][1]=1;
      r[x  ][1]=(r[x  ][1]+1)%2;
      r[x-1][2]=(r[x-1][2]+1)%2;
      r[x  ][2]=(r[x  ][2]+1)%2;
      r[x+1][2]=(r[x+1][2]+1)%2;
      r[x  ][3]=(r[x  ][3]+1)%2;
      s[x  ][2]=1;
      if(f(r,s,x+1))
	return 1;
    }
  }
  return 0;
}
int main(){
  int i,j,k;
  int q[12][12],r[12][12],n;
  int (*p)[12][12];
  cin>>n;
  p=new int[n][12][12];
  for(i=0;i<n;i++)
    for(j=1;j<11;j++)
      for(k=1;k<11;k++)
	cin>>p[i][k][j];
  for(i=0;i<n;i++){
    memcpy(r,&p[i][0][0],sizeof(r));
    memset(q,0,sizeof(q));
    f(r,q,1);
    memcpy(r,&p[i][0][0],sizeof(r));
    memset(q,0,sizeof(q));
    r[1][0]=(r[1][0]+1)%2;
    r[0][1]=(r[0][1]+1)%2;
    r[1][1]=(r[1][1]+1)%2;
    r[2][1]=(r[2][1]+1)%2;
    r[1][2]=(r[1][2]+1)%2;
    q[1][1]=1;
    f(r,q,1);
  }
  delete [] p;
  return 0;
}