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<vector>
#include<queue>
#include<algorithm>
#include<cstring>
#include<cstdlib>

#define MAX 12
#define INV (-1)

using namespace std;

inline bool inRange(int t, int min, int max){
	return (min <= t && t < max);
}

class CMap{
public:
	int m[MAX][MAX];

	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)
			if( inRange( i+di[k], 1, MAX - 1 ) && inRange( j + dj[k], 1, MAX - 1 ) )
				m[i+di[k]][j+dj[k]] = (m[i+di[k]][j+dj[k]] + 1) % 2;

		cout << "Shot: " << i << "," << j << endl;
	}

	bool NoLight() const
	{
		for(int i = 1; i < MAX - 1; ++i)
			for(int j = 1; j < MAX - 1; ++j)
				if( m[i][j] == 1 ) 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 DetermineShootingPoints(CMap &stm, CMap &ans){
	while( !stm.NoLight() ){
		vector< pair<int, int > > vt;
		bool bSCont = true;

		/* corner 
		{
			if( stm.m[1][1] == 1 ){
				if( stm.m[1][2] == 1 && stm.m[2][1] == 1 ){
					stm.PassParticle( 1, 1 );
					ans.m[1][1] = 1;
				}
			}
			if( stm.m[1][MAX-2] == 1 ){
				if( stm.m[1][MAX-3] == 1 && stm.m[2][MAX-2] == 1 ){
					stm.PassParticle( 1, MAX-2 );
					ans.m[1][MAX-2] = 1;
				}
			}
			if( stm.m[MAX-2][1] == 1 ){
				if( stm.m[MAX-3][1] == 1 && stm.m[MAX-2][2] == 1 ){
					stm.PassParticle( MAX-2, 1 );
					ans.m[MAX-2][1] = 1;
				}
			}
			if( stm.m[MAX-2][MAX-2] == 1 ){
				if( stm.m[MAX-2][MAX-3] == 1 && stm.m[MAX-3][MAX-2] == 1 ){
					stm.PassParticle( MAX-2, MAX-2 );
					ans.m[MAX-2][MAX-2] = 1;
				}
			}
		}*/

		/* deko */
		{
			const int ci[] = {1,1,1,1,4,5,6,7,4,5,6,7,MAX-2,MAX-2,MAX-2,MAX-2};
			const int cj[] = {4,5,6,7,1,1,1,1,MAX-2,MAX-2,MAX-2,MAX-2,4,5,6,7};

			for(int i = 0; i < sizeof(ci)/sizeof(*ci); ++i ){
				int cnt1 = 0;
				const int di[] = {0,-1,0,1, 0};
				const int dj[] = {0, 0,1,0,-1};

				for(int j = 0; j < sizeof(di)/sizeof(*di); ++j){
					if( stm.m[ci[i]+di[j]][cj[i]+dj[j]] == 1 )
						cnt1++;
				}
				if( cnt1 == 4 ){
					int ccnt1 = 0;
					const int ddi[] = {-1,-1, 1, 1};
					const int ddj[] = {-1, 1, 1,-1};

					for( int j = 0; j < sizeof(ddi)/sizeof(*ddi); ++j){
						if( stm.m[ci[i]+ddi[j]][cj[i]+ddj[j]] == 1 )
							++ccnt1;
					}
					if( ccnt1 <= 1 ){
						stm.PassParticle( ci[i], cj[i] );
						ans.m[ci[i]][cj[i]] = 1;
					}
				}
			}
		}

		/* other */
		for(int i = 1; i < MAX - 1 && bSCont; ++i){
			for(int j = 1; j < MAX - 1 && bSCont; ++j){
				if( stm.m[i][j] == 1 ){
					const int di[][3] = {
						{0,-1,0},
						{-1,0,1},
						{0,1,0},
						{1,0,-1}
					};
					const int dj[][3] = {
						{-1,0,1},
						{0,1,0},
						{1,0,-1},
						{0,-1,0}
					};
					/* 
					const int di[][2] = { {0,-1}, {-1,0}, {0,1}, {1,0} };
					const int dj[][2] = { {-1,0}, {0,1}, {1,0}, {0,-1} };
					*/

					for(int k = 0; k < sizeof(di)/sizeof(*di); ++k){
						bool bCont = true;
						int tti, ttj;

						for(int l = 0; l < sizeof(*di)/sizeof(**di) && bCont; ++l){
							if( stm.m[i+di[k][l]][j+dj[k][l]] != 0 ||
								!inRange(i+di[k][1],1,MAX-1) ||
								!inRange(j+dj[k][1],1,MAX-1) ){
									tti = ttj = INV;
									bCont = false;
							}else{
								switch( k ){
									case 0: tti = i + 1; ttj = j; break;
									case 1: tti = i; ttj = j - 1; break;
									case 2: tti = i - 1; ttj = j; break;
									case 3: tti = i; ttj = j + 1; break;
								}
							}
						}
						if( bCont ){
							if( inRange(tti,1,MAX-1) && inRange(ttj,1,MAX-1) )
								vt.push_back( make_pair( tti, ttj ) );
						}
					}

					
				}
			}
		}

		if( vt.size() > 0 ){
			int ti = INV, tj = INV;
			int max1 = 0;
			double maxEfficient = 0.499;
			
			for(unsigned int t = 0; t < vt.size(); ++t){
				int cnt1 = 0;
				int invCnt = 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( !inRange(vt[t].first+di[k], 1, MAX-1) || !inRange(vt[t].second+dj[k],1,MAX-1) )
						invCnt++;
					if( stm.m[vt[t].first+di[k]][vt[t].second+dj[k]] == 1 )
						cnt1++;
				}

				if( cnt1 > max1 ){
					max1 = cnt1;
					if( (double)cnt1 / ( 5 - invCnt ) > maxEfficient ){
						maxEfficient = (double)cnt1 / (5 - invCnt);
						ti = vt[t].first;
						tj = vt[t].second;	
					}
				}
			}
			if( ti != INV && tj != INV ){
				stm.PassParticle( ti, tj );
				ans.m[ti][tj] = 1;
				bSCont = false;
			}
		}
	}
}
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];

		DetermineShootingPoints( M, Answer );
		Answer.Print();
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<math.h>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
bool mem[12][12],cop[12][12],done[12][12];

int main(){
  int n;cin>>n;
  while(n--){
    lol(i,10)lol(j,10)cin>>mem[i][j];
    bool flag[10],tmp[10]={0};
    for(int p=1;p<=1024;p++){
      lol(i,10)flag[i]=tmp[i];
      lol(i,10)lol(j,10)cop[i][j]=mem[i][j];
      for(int k=0;k<10;k++){
	lol(i,10){
	  if(!flag[i])continue;
	  for(int j=max(0,i-1);j<=min(9,i+1);j++)cop[k][j]^=1;
	  cop[k+1][i]^=1;
	}
	lol(i,10)done[k][i]=flag[i];
	lol(i,10)flag[i]=cop[k][i];
      }
      bool na=false;
      lol(i,10)na|=flag[i];
      if(!na){
	lol(i,10){
	  lol(j,10){
	    if(j)cout<<" ";
	    cout<<done[i][j];
	  }
	  cout<<endl;
	}
	break;
      }
      for(int i=0;i<10;i++){
	int r=pow(2,i);
	if(p%r==0)tmp[i]^=1;
      }
    }
  }
  return 0;
}