Codeforces Round #230 (Div. 2)B. Three matrices
来源:互联网 发布:centos 解压缩 编辑:程序博客网 时间:2024/05/16 09:05
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?
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).
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.
21 43 2
1.00000000 3.500000003.50000000 2.000000000.00000000 0.50000000-0.50000000 0.00000000
31 2 34 5 67 8 9
1.00000000 3.00000000 5.000000003.00000000 5.00000000 7.000000005.00000000 7.00000000 9.000000000.00000000 -1.00000000 -2.000000001.00000000 0.00000000 -1.000000002.00000000 1.00000000 0.00000000
解题报告:
此题为纯粹数学题。代码如下:
#include <iostream>#include <cstdio>using namespace std;double w[175][175],a[175][175],b[175][175];int main(){ int n; scanf("%d",&n); for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) scanf("%lf",&w[i][j]); for(int i=1;i<=n;i++) for(int j=1;j<=i;j++){ a[i][j]=(w[i][j]+w[j][i])/2; a[j][i]=a[i][j]; b[i][j]=w[i][j]-a[i][j]; b[j][i]=b[i][j]-2*b[i][j]; } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if(j==1) printf("%.8lf",a[i][j]); else printf(" %.8lf",a[i][j]); } printf("\n"); } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if(j==1) printf("%.8lf",b[i][j]); else printf(" %.8lf",b[i][j]); } printf("\n"); } return 0;}
- Codeforces Round #230 (Div. 2)B. Three matrices
- Codeforces Round #230 (Div. 2)B. Three matrices
- codeforces--2014/2/20--B. Three matrices
- Codeforces 393B Three matrices(数论)
- Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2) B. Bear and Three Musketeers(STL_暴力)
- Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2)B Bear and Three Musketeers
- Codeforces Round #277.5 (Div. 2) F. Special Matrices
- Codeforces Round #277.5 (Div. 2)-F. Special Matrices
- Codeforces Round #318 (Div. 2) B. Bear and Three Musketeers 位运算压缩
- CF#230 B题 Three matrices
- Codeforces Round #322 (Div. 2) D. Three Logos
- Codeforces Round #327 (Div. 2)E. Three States
- Codeforces Round #322 (Div. 2) D. Three Logos(暴力)
- Codeforces Round #230 (Div. 1)B,C
- Codeforces Round #131 (Div. 2) A B
- Codeforces Round #134 (Div. 2)B. Airport
- Codeforces Round #170 (Div. 2) problem B
- Codeforces Round #173 (Div. 2) Problem B
- C语言与java的不同及平时编写java程序出现的错误
- linux命令之权限管理命令
- 398高校毕业设计选题
- 程序员对堆和栈应该要有的理解
- 第一次在虚拟机下安装Solaris系统不成功+截图保存(1/2)
- Codeforces Round #230 (Div. 2)B. Three matrices
- zigbee学习笔记--电源管理OSAL机制的ZigBee低功耗管理(CC2530)
- 一点小感触
- Android基础学习篇之一:Intent初步
- 读书笔记
- request.getContextPath()使用
- zju3261 Connections in Galaxy War
- thinkphp学习--入口文件--1
- MFileServer管理员用户名密码配置