HDU 4920 稀疏矩阵相乘
2014-08-05 17:37
387 查看
暴力啊,不要想太多
T^T g艹太坑爹了
T^T g艹太坑爹了
#include <cstdio> #include <cstring> #include <algorithm> using namespace std; inline void rd(int &ret) { char c; do { c = getchar(); } while(c < '0' || c > '9'); ret = c - '0'; while((c=getchar()) >= '0' && c <= '9') ret = ret * 10 + ( c - '0' ); } inline void ot(int a) //输出外挂 { if(a>9) ot(a/10); putchar(a%10+'0'); } const int MAX_N = 807; int n; int a[MAX_N][MAX_N], b[MAX_N][MAX_N]; int c[MAX_N][MAX_N]; int main() { while (1 == scanf("%d", &n)) { for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { int x; rd(x); a[i][j] = x % 3; } } for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { int x; rd(x); b[i][j] = x % 3; } } memset(c, 0, sizeof(c)); for (int i = 0; i < n; ++i) { for (int k = 0; k < n; ++k) { if (a[i][k] == 0) continue; 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 == 0) ot(c[i][j]%3); else {putchar(' '); ot(c[i][j]%3);} } puts(""); } } return 0; }
相关文章推荐
- HDU 4920 Matrix multiplication 矩阵相乘。稀疏矩阵
- 【城会玩】hdu 4920 Matrix multiplication【矩阵相乘优化】
- HDU 4920 Matrix multiplication(矩阵相乘)
- HDU 4920 Matrix multiplication(矩阵相乘小优化)
- HDU 4920 Matrix multiplication(矩阵相乘小优化)
- hdu 4920 Matrix multiplication 多校第五场 稀疏矩阵乘法
- hdu 4920 Matrix multiplication (矩阵相乘)
- HDU 4920 Matrix multiplication(稀疏矩阵的乘法)不优化很容易TLE
- HDU 4920 Matrix multiplication(简单矩阵相乘+技巧减少Mod次数)
- hdu 4920 Matrix multiplication(矩阵相乘)2014多校训练第5场
- HDU 4920 Matrix multiplication(矩阵相乘)
- hdu 4920 Matrix multiplication(多校第5场,矩阵相乘)
- hdu 4920 快速矩阵相乘 以后得换一种写法了
- 【HDU】4920 - Matrix multiplication(矩阵相乘)
- HDU 4965 Fast Matrix Calculation (矩阵快速幂取模----矩阵相乘满足结合律)
- hdu 4920矩阵连乘
- Tr A hdu 1575 二分法矩阵相乘的高次幂
- 实现稀疏矩阵相乘C/C++
- 10.稀疏矩阵的存储 转置 相乘
- HDU_4920_Matrix multiplication_杭电多校1010_矩阵乘法的代码风格