code forces 393B Three matrices
2014-02-19 12:16
309 查看
code forces 393B Three matrices 题目链接:http://codeforces.com/problemset/problem/393/B
题目大意:给出一个n阶矩阵W,按要求输出两个n阶矩阵A和B。
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).
题目分析:通过观察和少量分析可得,求平均数再减可以达到题目要求的效果。
code:
题目大意:给出一个n阶矩阵W,按要求输出两个n阶矩阵A和B。
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).
题目分析:通过观察和少量分析可得,求平均数再减可以达到题目要求的效果。
code:
#include<stdio.h> int main() { int n,i,j,a[200][200]; double temp,b[200][200],c[200][200]; scanf("%d",&n); for(i=0;i<n;i++) { for(j=0;j<n;j++) { scanf("%d",&a[i][j]); if(i==j)b[i][j]=(double)a[i][j]; if(i>j) { temp=(double)(a[i][j]+a[j][i])/2.; b[i][j]=b[j][i]=temp; c[i][j]=a[i][j]-temp; c[j][i]=-c[i][j]; } } } for(i=0;i<n;i++) { for(j=0;j<n;j++) { printf("%.8f%s",b[i][j],j==n-1?"\n":" "); } } for(i=0;i<n;i++) { for(j=0;j<n;j++) { printf("%.8f%s",c[i][j],j==n-1?"\n":" "); } } return 0; }PS:水题一道,无技术含量。
相关文章推荐
- Code Forces 342 A. Xenia and Divisors 思维+暴力
- code forces 394B Very Beautiful Number
- Code Forces 414B 挺不错的递推动规
- Code Forces 559 C. Gerald and Giant Chess(组合数学+dp)
- Code Forces 37A Towers
- 【Code Forces 320B】【水题】Finding Team Member 最优组队匹配
- Code Forces 585 B. Phillip and Trains(BFS)
- Code Forces 496 B. Secret Combination(水~)
- Code Forces 652A Gabriel and Caterpillar
- Code Forces 21C Stripe 2
- Code Forces 612A-----思维题
- 【code forces】652A模拟
- Code Forces 589G Hiring(树状数组)
- Code Forces 327A - Flipping Game 贪心 暴力
- 【stack果然神器】code forces 394C Dominoes
- Code Forces 448C Painting Fence 贪心递归
- Code Forces 538 A. Cutting Banner(水~)
- Code Forces 567B Berland National Library
- 【Code Forces 320A】【二进制拆分】Raising Bacteria 细胞繁殖 每天倍增
- Code Forces 585 C. Alice, Bob, Oranges and Apples(数论)