ProBlem F

模拟~

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <algorithm>
//#include "myAlgorithm.h"
#define MAX 15
#define INF 1e18
#define eps 1e-5
using namespace std;
int s[MAX][MAX];
int p[MAX][MAX];
int dir[][2] = {{1, 0},{-1, 0}, {0, 1}, {0, -1}};
void solve(){
    for(int i = 1; i < 4; i++){
        for(int j = 1; j < 4; j++){
            for(int k = 0; k < p[i][j]%2; k++){
                s[i][j] = (s[i][j] + 1)%2;
                for(int kk = 0; kk < 4; kk++){
                    int I = i + dir[kk][0], J = j + dir[kk][1];
                        if(I < 4 && I > 0 && J > 0 && J < 4){
                            s[I][J] = (s[I][J] + 1)%2;
                        }
                }
            }
        }
    }
    for(int i = 1; i < 4; i++){
        for(int j = 1; j < 4; j++){
            cout<<(s[i][j] + 1)%2;
        }cout<<endl;
    }
}
int main() {
    //freopen("in.txt", "w", stdout);
    while(cin>>p[1][1]>>p[1][2]>>p[1][3]){
         for(int i = 2; i < 4; i++){
            for(int j = 1; j < 4; j++){
                cin>>p[i][j];
            }
        }memset(s, 0, sizeof(s));
        solve();
    }
    return 0;
}