HDOJ 题目4920 Matrix multiplication（矩阵相乘，优化）

Matrix multiplication

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

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

  
  

   
   1
0
1
2
0 1
2 3
4 5
6 7
  
  

 

Sample Output

  
  

   
   0
0 1
2 1
  
  

 

Author

Xiaoxu Guo (ftiasch)

 

Source

2014 Multi-University Training Contest 5

 

Recommend

We have carefully selected several similar problems for you:   5081  5080  5079  5078  5077 

 

ac代码

#include<stdio.h>
#include<string.h>
int a[1010][1010],b[1010][1010],ans[1010][1010];
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		int i,j,k;
		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;
			}
		}
		memset(ans,0,sizeof(ans));
		for(k=0;k<n;k++)//这一层放在最里边会超时
		{
			for(i=0;i<n;i++)
				for(j=0;j<n;j++)
				{
					ans[i][j]+=a[i][k]*b[k][j];
				}
		}
		for(i=0;i<n;i++)
		{
			for(j=0;j<n;j++)
			{
				ans[i][j]%=3;//边输出边对3取余
				if(j)
					printf(" %d",ans[i][j]);
				else
					printf("%d",ans[i][j]);
			}
			printf("\n");
		}

	}
}