POJ 2965 The Pilots Brothers' refrigerator 深搜

好久没敲深搜了，弱弱比较难想~~~~看了题解才做出来的

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

int map[6][6];
char a[6][6];
int b[105][2];
int flag;
int ans;

bool check()
{
    int i, j;
    for(i = 1;i <= 4;i++){
        for(j = 1;j <= 4;j++){
            if(map[i][j] != 1)
                return false;
        }
    }
    return true;
}
void change(int x, int y)
{
    int i;
    for(i = 1;i <= 4;i++){
        map[x][i] = !map[x][i];
        map[i][y] = !map[i][y];
    }
    map[x][y] = !map[x][y];
}
void dfs(int x, int y, int cur)
{
    if(cur == ans){
        flag = check();
        return ;
    }
    if(flag||x == 5)
        return;
    change(x,y);
    b[cur][0] = x;
    b[cur][1] = y;
    if(y < 4){
        dfs(x,y+1,cur+1);
    }else {
        dfs(x+1,1,cur+1);
    }
    change(x,y);
    if(y < 4){
        dfs(x,y+1,cur);
    }else{
        dfs(x+1,1,cur);
    }
}
int main()
{
    int i, j;
    for(i = 0;i < 4;i++){
        cin >> a[i];
    }
    for(i  =1;i <= 4;i++){
        for(j = 1;j <= 4;j++){
            if(a[i-1][j-1] == '-')
                map[i][j] = 1;
        }
    }
    for(ans = 0;ans <= 16;ans++){
        dfs(1,1,0);
        if(flag)    break;
    }
    if(flag){
        printf("%d\n", ans);
        for(i = 0;i <ans;i++){
            printf("%d %d\n", b[i][0], b[i][1]);
        }
    }

    return 0;
}