POJ 1222

#include <iostream>
using namespace std;

int _m[5][6];
int _p[5][6];
int tem[5][6];
int dir[4][2] = {1,0,-1,0,0,1,0,-1};
bool boo;
void DFS(int r,int c);

int main()
{
    //freopen("acm.acm","r",stdin);
    int test;
    int i;
    int j;
    int time = 0;
    cin>>test;
    while(test --)
    {
        boo = false;
        memset(_p,0,sizeof(_p));

        for(i = 0; i < 5; ++ i)
        {
            for(j = 0; j < 6; ++ j)
            {
                cin>>_m[i][j]; 
            }
        }
        
        DFS(0,0);
        cout<<"PUZZLE #"<<++ time<<endl;
        if(boo)
        for(i = 0; i < 5; ++ i)
        {
            for(j = 0; j < 6; ++ j)
            {
                cout<<_p[i][j]<<" ";
            }
            cout<<endl;
        }
    }

}

void DFS(int r,int c)
{
    int i;
    int j;
    int tem_a;
    int tem_b;
    int sum = 0;
    if(r == 6)
    {
        boo = true;
        return;
    }


    if(r == 5)
    {
        c = 6;
    }

    if(c == 6)
    {
        if(r >= 1)
        {
            for(i = 0; i < 6; ++ i)
            {
                sum = 0;
                for(j = 0; j < 4; ++ j)
                {
                    tem_a = r-1+dir[j][0];
                    tem_b = i + dir[j][1];
                    if(tem_a >= 0 && tem_a < 5 && tem_b >= 0 && tem_b < 6)
                    {
                        sum += _p[tem_a][tem_b];
                    }
                }
                sum += _p[r-1][i];
                if(sum % 2 != 0)
                {
                    if(_m[r-1][i] == 0)
                    {
                        return;
                    }
                }
                if(sum % 2 == 0)
                {
                    if(_m[r-1][i] == 1)
                    {                
                        return;
                    }
                }    
            }

        }
        DFS(r+1,0);
        if(boo)
            return;
    }
    else
    {
        _p[r][c] = 1;
        DFS(r,c+1);
        if(boo)
            return;
        _p[r][c] = 0;
        DFS(r,c+1);
    }
}

关注我的公众号，当然，如果你对Java, Scala, Python等技术经验，以及编程日记，感兴趣的话。 

技术网站地址： vmfor.com