hdoj4920Matrix multiplication【矩阵相乘】

最新推荐文章于 2017-06-17 19:38:32 发布

飘摇的尘土

最新推荐文章于 2017-06-17 19:38:32 发布

阅读量504

点赞数

分类专栏：矩阵快速幂文章标签： hdoj4920Matrix multi

本文链接：https://blog.csdn.net/R1986799047/article/details/49687827

版权

矩阵快速幂专栏收录该内容

8 篇文章 0 订阅

订阅专栏

Matrix multiplication

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 3827 Accepted Submission(s): 1573

Problem Description

Given two matrices A and B of size n×n, find the product of them.

bobo hates big integers. So you are only asked to find the result modulo 3.

Input

The input consists of several tests. For each tests:

The first line contains n (1≤n≤800). Each of the following n lines contain n integers -- the description of the matrix A. The j-th integer in the i-th line equals A _ij. The next n lines describe the matrix B in similar format (0≤A _ij,B _ij≤10 ⁹).

Output

For each tests:

Print n lines. Each of them contain n integers -- the matrix A×B in similar format.

Sample Input

Sample Output

Author

Xiaoxu Guo (ftiasch)

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int A[810][810];
int B[810][810];
int D[810][810];
void Mulit(int n){
	memset(D,0,sizeof(D));
	for(int i=0;i<n;++i){
		for(int k=0;k<n;++k){
			if(A[i][k]){
				for(int j=0;j<n;++j){
					D[i][j]=D[i][j]+(A[i][k]*B[k][j]);
				}
			}
		}
	}
	for(int i=0;i<n;++i){
		for(int j=0;j<n;++j){
			printf(j==0?"%d":" %d",D[i][j]%3);
		}
		printf("\n");
	}
}
int main()
{
	int n,i,j,k;
	while(scanf("%d",&n)!=EOF){
		for(i=0;i<n;++i){
			for(j=0;j<n;++j){
				scanf("%d",&A[i][j]);
				A[i][j]%=3;
			}
		}
		for(i=0;i<n;++i){
			for(j=0;j<n;++j){
				scanf("%d",&B[i][j]);
				B[i][j]%=3;
			}
		}
		Mulit(n);
	}
	return 0;
}