A. Lights Out

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Lenny is playing a game on a 3 × 3 grid of lights. In the beginning of the game all lights are switched on. Pressing any of the lights will toggle it and all side-adjacent lights. The goal of the game is to switch all the lights off. We consider the toggling as follows: if the light was switched on then it will be switched off, if it was switched off then it will be switched on.

Lenny has spent some time playing with the grid and by now he has pressed each light a certain number of times. Given the number of times each light is pressed, you have to print the current state of each light.

Input

The input consists of three rows. Each row contains three integers each between 0 to 100 inclusive. The j-th number in the i-th row is the number of times the j-th light of the i-th row of the grid is pressed.

Output

Print three lines, each containing three characters. The j-th character of the i-th line is "1" if and only if the corresponding light is switched on, otherwise it's "0".

Sample test(s)

input

1 0 0
0 0 0
0 0 1

output

001
010
100

input

1 0 1
8 8 8
2 0 3

output

010
011
100

解题说明：此题就是一个简单的二维数组题目，需要不断判断数组是否越界。这里写了一个子程序对灯泡的状态进行改变，让代码变得简洁不少。

#include<cstdio>
#include<iostream>

using namespace std;
int b[3][3];

void change(int i,int j)
{
	if(b[i][j]==0)
	{
		b[i][j]=1;
	}
	else
	{
		b[i][j]=0;
	}
}


int main()
{
	int i,j,a[3][3];
	for(i=0;i<3;i++)
	{
		for(j=0;j<3;j++)
		{
			b[i][j]=1;
			scanf("%d",&a[i][j]);
		}
	}
	for(i=0;i<3;i++)
	{
		for(j=0;j<3;j++)
		{
			a[i][j]=a[i][j]%2;
			if(a[i][j]!=0)
			{
				change(i,j);
				if(i-1>=0)
				{
					change(i-1,j);
				}
				if(i+1<3)
				{
					change(i+1,j);
				}
				if(j-1>=0)
				{
					change(i,j-1);
				}
				if(j+1<3)
				{
					change(i,j+1);
				}
			}
		}
	}
	for(i=0;i<3;i++)
	{
		for(j=0;j<3;j++)
		{
			printf("%d",b[i][j]);
		}
		printf("\n");
	}

	return 0;
}