Codeforces Round #157 (Div. 2)——B

B. Little Elephant and Magic Square

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Little Elephant loves magic squares very much.

A magic square is a 3 × 3 table, each cell contains some positive integer. At that the sums of integers in all rows, columns and diagonals of the table are equal. The figure below shows the magic square, the sum of integers in all its rows, columns and diagonals equals 15.

The Little Elephant remembered one magic square. He started writing this square on a piece of paper, but as he wrote, he forgot all three elements of the main diagonal of the magic square. Fortunately, the Little Elephant clearly remembered that all elements of the magic square did not exceed 10⁵.

Help the Little Elephant, restore the original magic square, given the Elephant's notes.

Input

The first three lines of the input contain the Little Elephant's notes. The first line contains elements of the first row of the magic square. The second line contains the elements of the second row, the third line is for the third row. The main diagonal elements that have been forgotten by the Elephant are represented by zeroes.

It is guaranteed that the notes contain exactly three zeroes and they are all located on the main diagonal. It is guaranteed that all positive numbers in the table do not exceed 10⁵.

Output

Print three lines, in each line print three integers — the Little Elephant's magic square. If there are multiple magic squares, you are allowed to print any of them. Note that all numbers you print must be positive and not exceed 10⁵.

It is guaranteed that there exists at least one magic square that meets the conditions.

Sample test(s)

input

0 1 1
1 0 1
1 1 0

output

1 1 1
1 1 1
1 1 1

input

0 3 6
5 0 5
4 7 0

output

6 3 6
5 5 5
4 7 4

Codeforces (c) Copyright 2010-2012 Mike Mirzayanov

//枚举第一个，暴力过
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int a[5][5];
int main()
{
    int i,j,k;
    for(i=1;i<=3;i++)
        for(j=1;j<=3;j++)
            scanf("%d",&a[i][j]);
    for(int i=1;;i++)
    {
        int sum=i+a[1][2]+a[1][3];
        j=sum-a[2][1]-a[2][3];
        k=sum-a[3][1]-a[3][2];
        if(j>0&&k>0&&i+j+k==sum)
        {
            a[1][1]=i;
            a[2][2]=j;
            a[3][3]=k;
            break;
        }
    }
    for(i=1;i<=3;i++)
        for(j=1;j<=3;j++)
           printf("%d%c",a[i][j],j==3?'\n':' ');
    return 0;
}
//很巧妙的方法，朋友写的
#include<stdio.h>
int main()
{
    int a[5][5];
    int i,sum=0,j;
    for(i=1;i<=3;i++)
        for(j=1;j<=3;j++)
        {
            scanf("%d",&a[i][j]);
            sum+=a[i][j];
        }
    sum/=2;
    a[1][1]=sum-a[1][2]-a[1][3];
    a[2][2]=sum-a[2][1]-a[2][3];
    a[3][3]=sum-a[3][1]-a[3][2];
    for(i=1;i<=3;i++)
    {
        for(j=1;j<=3;j++)
        {
          printf("%d%c",a[i][j],j==3?'\n':' ');
        }
    }
    return 0;
}