1维
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 25;
int a[N][N];
int cnt[5] = {0,0,0,0,0};
void flip(int id,int f){
if(id == 1 ){
a[f][1] = a[f][1] ^1;
a[f][2] = a[f][2] ^1;
cnt[f]++;
return ;
}
if(id >= 21){
return ;
}
for(int i = -1;i<2;i++){
a[f][id+i] ^=1;
}
cnt[f]++;
}
int main()
{
for(int i=1;i<=20;i++){
cin>>a[1][i];
a[4][i]=a[3][i]=a[2][i]=a[1][i];
}
for(int j=1;j<=4;j++){
if(j%2 == 0) {
flip(1,j);
}
for(int i=1;i<=20 ;i++){
if(a[j][i] == 1){
flip(i+1,j);
}
}
for(int i=1;i<=20;i++)
if(a[j][i] == 1){
cnt[j] = 0x3f3f;
break;
}
}
sort(cnt+1,cnt+5);
cout<<cnt[1];
}
二维
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 10;
int a[N][N],b[N][N],cop[N][N];
int n,cnt,ans,flag;
int dx[6] = {0,1,-1,0,0};
int dy[6] = {1,0,0,-1,0};
void init(){
for(int i = 1; i<= 5; i++){
for( int j = 1; j <= 6; j++){
b[i][j] = a[i][j];
cop[i][j] = 0;
}
}
}
void flip(int x,int y){
cnt++;
for(int i = 0; i<5; i++){
b[x+dx[i]][y+dy[i]] ^= 1;
}
cop[x][y] ^= 1;
}
bool check(){
for(int i = 1; i <= 6; i++){
if(b[5][i] == 1) return false;
}
return true;
}
void solve(){
for(int i = 2; i<= 5; i++){
for (int j = 1; j <= 6; j++){
if(b[i-1][j] == 1)
flip(i,j);
}
}
if(check()){
for(int i = 1; i <= 5; i++){
for( int j = 1; j <= 6; j++){
cout<< cop[i][j]<<" ";
}cout<<endl;
}
flag = 1;
}
}
int main(){
cin>>n;
int tot = 0;
while(n--){
flag = 0;
for(int i =1;i<=5;i++){
for(int j=1;j<=6;j++){
cin>>a[i][j];
}
}
cout<<"PUZZLE #"<<++tot<<endl;
for(int i = 1; i <= (1<<6); i++){
init();
for(int j = 0; j< 6; j++){
if(i&(1<<j)){
flip(1,j+1);
}
}
solve();
if(flag){
}
}
}
}