codeforces div2 round#230 B

来源：互联网发布：cosplay淘宝良心卖家编辑：程序博客网时间：2024/04/29 18:47

很水的题目，推出两个矩阵之间的关系然后直接输入就好了。

#include "cstdio"#include "cstring"#include "cmath"#include "algorithm"using namespace std;double w[222][222];double a[222][222];double b[222][222];int main(){    memset(a,0,sizeof(a));    memset(b,0,sizeof(b));    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<=n;j++){            if(i==j){                a[i][j]=w[i][j];                b[i][j]=0;            }else{                a[i][j]=(w[i][j]+w[j][i])/2.;                b[i][j]=(w[i][j]-w[j][i])/2.;            }        }    }    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;}

0 0