codeforces157Div2B

最新推荐文章于 2024-07-25 04:51:21 发布

didi3076

最新推荐文章于 2024-07-25 04:51:21 发布

阅读量142

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/shadow-justice/archive/2012/12/24/2830650.html

本文介绍了一个关于3x3魔方阵的问题，魔方阵的每一行、每一列及两个对角线上的数之和相等。题目要求在已知部分元素的情况下，通过推断找回遗忘的主对角线上的三个元素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

$\text{[math]}$

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




很水的样子。。穷举。。成功了

代码：

 1 #include<stdio.h>
 2 
 3 char arr[100005]={0};
 4 
 5 int main( void)
 6 {
 7     int i=0, j, k;
 8     while( scanf("%c", &arr[i]) != EOF )
 9         i++;
10     for( j=0; j<i; j++)
11     {
12         if( arr[j]=='0')
13         {
14             break;
15         }
16     }
17     if( j==i)
18         j--;
19     for( k=0; k<j; k++)
20     {
21             printf("%c", arr[k]);
22     }
23     for( k=j+1; k<i; k++)
24         printf("%c", arr[k]);
25     return 0;
26 }