CF259B.Little Elephant and Magic Square

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Little Elephant loves magic squares very much.

A magic square is a 3×33×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 10510^{5} .

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

输入格式

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 10510^{5} .

输出格式

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 10510^{5} .

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

输入输出样例

  • 输入#1

    0 1 1
    1 0 1
    1 1 0
    

    输出#1

    1 1 1
    1 1 1
    1 1 1
    
  • 输入#2

    0 3 6
    5 0 5
    4 7 0
    

    输出#2

    6 3 6
    5 5 5
    4 7 4
    
首页