【HDU-oj】-4920-Matrix multiplication（矩阵，裸）

最新推荐文章于 2021-10-22 12:29:51 发布

Bear1997

最新推荐文章于 2021-10-22 12:29:51 发布

阅读量411

点赞数

分类专栏：矩阵

本文链接：https://blog.csdn.net/Bear1998/article/details/60468166

版权

矩阵专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Matrix multiplication

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

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

题解：虽然说是一个矩阵乘法的裸题，但是A的好不容易啊！TLE n次.

#include <cstdio>
#include <cstring> 
#include <algorithm>
using namespace std;
#define CLR(a,b) memset(a,b,sizeof(a))
int A[806][806],B[806][806],C[806][806]; 
int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		for(int i=1;i<=n;i++) 
		{
			for(int j=1;j<=n;j++)
			{
				scanf("%d",&A[i][j]);
				A[i][j]%=3;
			}	
		}
		for(int i=1;i<=n;i++) 
		{
			for(int j=1;j<=n;j++)
			{
				scanf("%d",&B[i][j]);
				B[i][j]%=3;
			}					
		}
		CLR(C,0);
		for(int i=1;i<=n;i++) 
		{
			for(int j=1;j<=n;j++)
			{
				if(A[i][j]==0)
					continue;
				for(int k=1;k<=n;k++)
					C[i][k]=(C[i][k]+A[i][j]*B[j][k]);
			}
		}	
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<n;j++)
				printf("%d ",C[i][j]%3);
			printf("%d\n",C[i][n]%3);
		}
	}
	return 0;
}