zoukankan      html  css  js  c++  java
  • Little Elephant and Magic Square

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

    Example

    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


    本题为数学题,列方程可得解
    将第一个至第九个元素分别用字母代表,即方阵为 a b c
                           d e f
                           g h i
    a,e,h为未知数

    代码如下
     1 #include<cstdio>
     2 #include<iostream>
     3 #include<algorithm>
     4 #include<cstring>
     5 #include<cmath>
     6 using namespace std;
     7  
     8 int main()
     9 {
    10     int A,B,C,D,E,F,G,H,I;
    11     scanf("%d%d%d%d%d%d%d%d%d",&A,&B,&C,&D,&E,&F,&G,&H,&I);
    12     I = D + (F - H)/2;
    13     A = (F+H)/2;
    14     E = B+C - I;
    15     printf("%d %d %d
    %d %d %d
    %d %d %d
    ",A,B,C,D,E,F,G,H,I);
    16     return 0;
    17 }



  • 相关阅读:
    51nod 1428 活动安排问题
    COGS 1. 加法问题 (水体日常)
    COGS 1406. 邻居年龄排序[Age Sort,UVa 11462](水题日常)
    51nod 1133 不重叠的线段
    51nod 1031 骨牌覆盖
    51nod 1050 循环数组最大子段和
    51nod 1094 和为k的连续区间
    51nod 1433 0和5
    51nod 1092 回文字符串
    洛谷 P1507 NASA的食物计划
  • 原文地址:https://www.cnblogs.com/Lightfall/p/8322442.html
Copyright © 2011-2022 走看看