poj3279

给你一个01矩阵，矩阵大小为M x N。（1 <= M , N <= 15）
每次操作选择一个格子，使得该格子与上下左右四个格子的值翻转。
至少多少次操作可以使得矩阵中所有的值变为0？

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#include<set>
using namespace std;
const int MAX = 20;
int M, N;
int m[MAX][MAX];
int ans[MAX][MAX];
int temp[MAX][MAX];
int dx[5] = { -1,0,0,0,1 };
int dy[5] = { 0,-1,0,1,0 };
int tone(int x, int y) 
{
	int c = m[x][y]; 
	for (int i = 0; i < 5; i++) 
	{
		int x2 = x + dx[i];
		int y2 = y + dy[i];
		if (0 <= x2 && x2 < M && 0 <= y2 && y2 < N)
		{
			c += temp[x2][y2];
		}
	}
	return c % 2;
}
int saber() 
{
	for (int i = 1; i < M; i++) 
	{
		for (int j = 0; j < N; j++) 
		{
			if (tone(i - 1, j) != 0) 
			{
				temp[i][j] = 1;
			}
		}
	}
	for (int i = 0; i < N; i++)
	{
		if (tone(M - 1, i) != 0)
		{
			return -1;
		}
	}
	int sum = 0;
	for (int i = 0; i < M; i++)
	{
		for (int j = 0; j < N; j++)
		{
			sum += temp[i][j];
		}
	}
	return sum;
}

void Solve() {
	int res = -1;
	for (int i = 0; i < 1 << N; i++) 
	{
		memset(temp, 0, sizeof(temp));
		for (int j = 0; j < N; j++)
		{
			temp[0][N - 1 - j] = i >> j & 1;//二进制枚举
		}
		int num = saber();
		if (num >= 0 && (res < 0 || res > num)) 
		{
			res = num;
			memcpy(ans, temp, sizeof(temp));
		}
	}
	if (res < 0)
		cout << "IMPOSSIBLE" << endl;
	else 
	{
		for (int i = 0; i < M; i++)
		{
			for (int j = 0; j < N; j++)
			{
				printf("%d ", ans[i][j]);
			}
			printf("\n");
		}
	}
}
int main() {

	cin >> M >> N;
	for (int i = 0; i < M; i++)
		for (int j = 0; j < N; j++)
			cin >> m[i][j];

	Solve();
	return 0;
}