CF393B.Three matrices

普及/提高-

通过率:0%

AC君温馨提醒

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

题目描述

Chubby Yang is studying linear equations right now. He came up with a nice problem. In the problem you are given an n×nn×n matrix WW , consisting of integers, and you should find two n×nn×n matrices AA and BB , all the following conditions must hold:

  • Aij=AjiA_{ij}=A_{ji} , for all i,ji,j (1<=i,j<=n)(1<=i,j<=n) ;
  • Bij=BjiB_{ij}=-B_{ji} , for all i,ji,j (1<=i,j<=n)(1<=i,j<=n) ;
  • Wij=Aij+BijW_{ij}=A_{ij}+B_{ij} , for all i,ji,j (1<=i,j<=n)(1<=i,j<=n) .

Can you solve the problem?

输入格式

The first line contains an integer nn (1<=n<=170)(1<=n<=170) . Each of the following nn lines contains nn integers. The jj -th integer in the ii -th line is WijW_{ij} (0<=|W_{ij}|<1717) .

输出格式

The first nn lines must contain matrix AA . The next nn lines must contain matrix BB . Print the matrices in the format equal to format of matrix WW in input. It is guaranteed that the answer exists. If there are multiple answers, you are allowed to print any of them.

The answer will be considered correct if the absolute or relative error doesn't exceed 10410^{-4} .

输入输出样例

  • 输入#1

    2
    1 4
    3 2
    

    输出#1

    1.00000000 3.50000000
    3.50000000 2.00000000
    0.00000000 0.50000000
    -0.50000000 0.00000000
    
  • 输入#2

    3
    1 2 3
    4 5 6
    7 8 9
    

    输出#2

    1.00000000 3.00000000 5.00000000
    3.00000000 5.00000000 7.00000000
    5.00000000 7.00000000 9.00000000
    0.00000000 -1.00000000 -2.00000000
    1.00000000 0.00000000 -1.00000000
    2.00000000 1.00000000 0.00000000
    
首页