hdu 4920 Matrix multiplication 多校第五场 稀疏矩阵乘法
2014-08-06 10:21
405 查看
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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 Aij. The next n lines describe the matrix B in similar format (0≤Aij,Bij≤109).
[align=left]Output[/align]
For each tests:
Print n lines. Each of them contain n integers -- the matrix A×B in similar format.
一定要在最里层的循环优化,否则就要TLE。。还有就是输出的时候每一行没有后导0
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.
[align=left]Input[/align]
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 Aij. The next n lines describe the matrix B in similar format (0≤Aij,Bij≤109).
[align=left]Output[/align]
For each tests:
Print n lines. Each of them contain n integers -- the matrix A×B in similar format.
一定要在最里层的循环优化,否则就要TLE。。还有就是输出的时候每一行没有后导0
//1453MS 7892K #include <cstdio> #include <iostream> #include <cstring> using namespace std; int a[805][805], b[805][805]; int c[805][805]; int main(){ int n; while(scanf("%d", &n) != EOF){ for(int i=0; i<n; i++) for(int j=0; j<n; j++){ scanf("%d", &a[i][j]); a[i][j] %= 3; } for(int i=0; i<n; i++) for(int j=0; j<n; j++){ scanf("%d", &b[i][j]); b[i][j] %= 3; } memset(c, 0, sizeof(c)); 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++){ c[i][j] += a[i][k]*b[k][j]; } } } } for(int i=0; i<n; i++){ for(int j=0; j<n; j++){ if(j == n-1) printf("%d\n", c[i][j] % 3); else printf("%d ", c[i][j] % 3); } } } return 0; }
相关文章推荐
- 2014多校第五场1010 || HDU 4920 Matrix multiplication(矩阵乘法优化)
- HDU 4920 Matrix multiplication(稀疏矩阵的乘法)不优化很容易TLE
- 矩阵乘法 --- hdu 4920 : Matrix multiplication
- HDU 4920 稀疏矩阵相乘
- Hdu 4920 Matrix multiplication[矩阵乘法的时间复杂度优化]
- HDU 4920 Matrix multiplication 矩阵相乘。稀疏矩阵
- HDU 4920 Matrix multiplication(矩阵乘法)
- hdu 4920 Matrix multiplication(矩阵乘法)
- HDU 4920(Matrix multiplication-矩阵乘法优化)
- HDU 4920 Matrix multiplication(矩阵乘法)
- 2013 多校第九场 hdu 4686 Arc of Dream(矩阵乘法或者直接推公式)
- HDU 4920 Matrix multiplication(矩阵乘法小技巧)——2014 Multi-University Training Contest 5
- HDU_4920_Matrix multiplication_杭电多校1010_矩阵乘法的代码风格
- HDU 4920 Matrix multiplication(矩阵乘法,cin,cout超时呀)
- hdu 4920 Matrix multiplication(矩阵乘法)2014多培训学校5现场
- hdu 4920 Matrix multiplication(矩阵相乘)2014多校训练第5场
- HDU 4920 坑爹的矩阵乘法
- hdu 4920暑假多校5的1010 Matrix multiplication 矩阵
- hdu--4920--原来一直写了速度慢的矩阵乘法
- hdu 4920 Matrix multiplication(多校第5场,矩阵相乘)