1. 题目
2. 代码
当我反应过来的时候已经过了两个星期了,并没有自己从头开始敲代码(毕竟也没有验证机会了orz
#include <iostream>
using namespace std;
#define max 1000
typedef struct Triple
{
int i, j;
int e;
} Triple;
typedef struct TSMatrix
{
Triple elem[max];
int rpos[max];
int mu, nu, tu;
} TSMatrix;
TSMatrix* Matrix_Init(TSMatrix* M)
{
M = (TSMatrix*)malloc(sizeof(TSMatrix));
M->mu = 0;
M->nu = 0;
M->tu = 0;
int i, j, x;
cin >> M->mu >> M->nu;
while (1)
{
cin >> i >> j >> x;
if (i == 0 && j == 0 && x == 0)
break;
else
{
M->elem[M->tu].i = i;
M->elem[M->tu].j = j;
M->elem[M->tu].e = x;
M->tu++;
}
}
//计算rpos;
int num[max];
for (int i = 0; i < M->mu; i++)
num[i] = 0;
for (int j = 0; j < M->tu; j++)
num[M->elem[j].i]++;
M->rpos[0] = 0;
for (int k = 1; k <= M->mu; k++)
M->rpos[k] = M->rpos[k - 1] + num[k - 1];
return M;
}
TSMatrix* MultiMatrix(TSMatrix* A, TSMatrix* B, TSMatrix* C)
{
C = (TSMatrix*)malloc(sizeof(TSMatrix));
if (A->nu != B->mu)
printf("error");
int temp[max];
for (int i = 0; i < max; i++) //初始化
temp[i] = 0;
C->mu = A->mu;
C->nu = B->nu;
C->tu = 0;
C->rpos[0] = 0;
int arow, brow, ccol, p, q, ta, tb;
if (A->tu * B->tu != 0)
{
for (arow = 1; arow <= A->mu; arow++)
{
for (int i = 0; i < max; i++) //初始化
temp[i] = 0;
C->rpos[arow] = C->tu;
if (arow < A->mu) //获得A的该行非0元数
ta = A->rpos[arow + 1];
else
ta = A->tu;
for (p = A->rpos[arow]; p < ta; ++p) //A->elem[p];
{
brow = A->elem[p].j;
if (brow < B->mu) //取B的列标行的非0数
tb = B->rpos[brow + 1];
else
tb = B->tu;
for (q = B->rpos[brow]; q < tb; ++q)
{
ccol = B->elem[q].j;
temp[ccol] += A->elem[p].e * B->elem[q].e; //累加
}
}
for (ccol = 1; ccol <= C->nu; ccol++)
{
if (temp[ccol] != 0)
{
C->elem[C->tu].i = arow;
C->elem[C->tu].j = ccol;
C->elem[C->tu].e = temp[ccol];
C->tu++;
}
}
}
}
return C;
}
void Print_List(TSMatrix* M)
{
for (int i = 0; i < M->tu; i++)
{
cout << M->elem[i].i << " " << M->elem[i].j << " " << M->elem[i].e << endl;
}
}
int main()
{
TSMatrix *A, *B, *C;
//在init中进行malloc空间分配
A = Matrix_Init(A);
B = Matrix_Init(B);
C = MultiMatrix(A, B, C);
Print_List(C);
return 0;
}