1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84#include <bits/stdc++.h>
using namespace std;

vector<int> opt_list;
vector<int> ans(10);

int lamb[10];

void init(){
    int i,j;
    int n = 5;
    for(i=1;i<=n;i++){
        int res=0,t = 0;
        for(j=1;j<=n+1;j++){
            scanf("%d",&t);
            res <<=1;
            if( t )
                res |= 1;
        }
        lamb[i] = res;
    }
    /* 生成 opt_list */
    n = (1<<6)-1;
    for(i=n;i >0;i = (i-1) &n){ // 枚举子集
        opt_list.push_back(i);
    }
    opt_list.push_back(0);
}


const int max_height = (1<<6)-1;
bool dfs(int dep){

    if( dep == 5+1){
        if( (lamb[dep-1] & max_height) == 0 ){
            /* 输出结果 */
            int i,j;
            for(i=1;i<=5;i++){
                int t = ans[i];
                for(j=5;j>=0;j--){
                    printf("%d ",(t & (1<<j))? 1 :0 );
                }
                printf("\n");
            }

            return 1;
        }

        return 0;
    }

    /* 记录 3 行的状态 */
    int up = lamb[dep-1];
    int now = lamb[dep];
    int down = lamb[dep+1];

    for(auto x : opt_list){
        int _up = (up^x) & max_height ;
        if( dep == 1 || _up == 0){
            int _down = (down ^x) & max_height;
            int _now = ((((x<<1)^now ) ^x) ^(x>>1) ) & max_height;

            lamb[dep-1] = _up;
            lamb[dep] = _now;
            lamb[dep+1] = _down;
            ans[dep] = x;
            if( dfs(dep+1) )
                return 1;
            lamb[dep-1] = up;
            lamb[dep] = now;
            lamb[dep+1] = down;
        }
    }
    return 0;
}



int main(){
    init();
    bool bol = dfs(1);
    //printf("%d\n",bol);
    return 0;
}