CF #230 (Div. 2) B

最新推荐文章于 2022-11-30 19:53:23 发布

Yuer-

最新推荐文章于 2022-11-30 19:53:23 发布

阅读量689

点赞数

分类专栏： 50 CF

本文链接：https://blog.csdn.net/yuer158462008/article/details/19442051

版权

50 同时被 2 个专栏收录

50 篇文章 0 订阅

订阅专栏

12 篇文章 0 订阅

订阅专栏

这个简单，x+y=a , x-y=b 求x,y

大概就是这东西

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

Aij = Aji, for all i, j (1 ≤ i, j ≤ n);
Bij = - Bji, for all i, j (1 ≤ i, j ≤ n);
Wij = Aij + Bij, for all i, j (1 ≤ i, j ≤ n).

Can you solve the problem?

Input

The first line contains an integer n (1 ≤ n ≤ 170). Each of the following n lines contains n integers. The j-th integer in the i-th line is Wij(0 ≤ |Wij| < 1717).

Output

The first n lines must contain matrix A. The next n lines must contain matrix B. Print the matrices in the format equal to format of matrix Win 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 10 - 4.

   Sample test(s) 
 

     input 
   
2
1 4
3 2

     output 
   
1.00000000 3.50000000
3.50000000 2.00000000
0.00000000 0.50000000
-0.50000000 0.00000000

     input 
   
3
1 2 3
4 5 6
7 8 9

     output 
   
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

#include <cstdio>
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <fstream>
#include <math.h>
#include <queue>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;
double w[175][175];
double a[175][175];
double b[175][175];
int main()
{
	//freopen ("input.txt","r",stdin);
	int n;
	cin>>n;
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)
		{
			cin>>w[i][j];
			if(i==j)
				a[i][i]=w[i][i],b[i][i]=0;
		}

	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)
			if(i!=j)
			{
				b[i][j]=(w[i][j]-w[j][i])/2.0;
				a[i][j]=(w[i][j]+w[j][i])/2.0;
			}
	for (int i = 1; i <= n; ++i){
		for (int j = 1; j <= n-1; ++j)
			printf("%.8f ",a[i][j]);
		printf("%.8f\n",a[i][n]);
	}
	for (int i = 1; i <= n; ++i){
		for (int j = 1; j <= n-1; ++j)
			printf("%.8f ",b[i][j]);
		printf("%.8f\n",b[i][n]);
	}
	return 0;
}