点击打开链接
Matrix multiplication
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 2113 Accepted Submission(s): 956
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
9).
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
直接矩阵相乘，果断TLE。要用求稀疏矩阵的方法来解此题，才能ac，果断卡时间。
//1703MS 7868K
#include
#include
#define M 3 int a[807][807],b[807][807],c[807][807]; int n; void init()//建立矩阵 { for(int i=0;i
|