CodeForces-259B]Little Elephant and Magic Square

Posted lunatic-talent

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了CodeForces-259B]Little Elephant and Magic Square相关的知识,希望对你有一定的参考价值。

 

Little Elephant loves magic squares very much.

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 105.

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 105.

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 105.

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

Examples
input
Copy
0 1 1
1 0 1
1 1 0
output
Copy
1 1 1
1 1 1
1 1 1
input
Copy
0 3 6
5 0 5
4 7 0
output
Copy
6 3 6
5 5 5
4 7 4
#include<bits/stdc++.h>
using namespace std;
#define maxn 300010
#define LL long long
int a[5][5];
int main()

    int i,j;
    for(i=1; i<=3; i++)
        for(j=1; j<=3; j++)
            cin>>a[i][j];
    a[3][3]=(a[1][2]+a[1][3]+a[2][1]+a[2][3]-a[3][1]-a[3][2])/2;
    a[2][2]=(a[1][2]+a[1][3]-a[2][1]-a[2][3]+a[3][1]+a[3][2])/2;
    a[1][1]=(-a[1][2]-a[1][3]+a[2][1]+a[2][3]+a[3][1]+a[3][2])/2;
    for(i=1; i<=3; i++)
    
        for(j=1; j<=3; j++)
            cout<<a[i][j]<< ;
        cout<<endl;
    
    return 0;

 

 

以上是关于CodeForces-259B]Little Elephant and Magic Square的主要内容,如果未能解决你的问题,请参考以下文章

codeforces259B

Little Dima and Equation

B. Little Pony and Harmony Chest(状压dp)

A. Little Artem1000 / 构造

A. Little C Loves 3 I Codeforces Round #511 (Div. 2) 数学

Codeforces 453B Little Pony and Harmony Chest:状压dp记录转移路径