#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 110;
class Matrix
{
public:
int rowCount,colCount;
ll mat[N][N];
};
// 矩阵乘法
Matrix mat_mult(Matrix a,Matrix b)
{
Matrix ans;
for(int i = 0; i < a.rowCount; i++)
{
for(int j = 0; j < b.colCount; j++)
{
ll tmp = 0;
for(int k = 0; k < a.colCount; k++)
{
tmp += a.mat[i][k] * b.mat[k][j];
}
ans.mat[i][j] = tmp;
}
}
ans.rowCount = a.rowCount;
ans.colCount = b.colCount;
return ans;
}
//矩阵转置
Matrix mat_transpose(Matrix a)
{
Matrix res;
for(int i = 0; i < a.rowCount; i++)
{
for(int j = 0; j < a.colCount; j++)
{
res.mat[j][i] = a.mat[i][j];
}
}
res.rowCount = a.colCount;
res.colCount = a.rowCount;
return res;
}
//读入转置矩阵
void read_transmat(Matrix &a,int m,int n)
{
a.rowCount = n;
a.colCount = m;
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
cin>>a.mat[j][i];
}
}
}
//读入矩阵
void read_mat(Matrix &a,int m,int n)
{
a.rowCount = m;
a.colCount = n;
for(int i = 0; i < a.rowCount; i++)
{
for(int j = 0; j < a.colCount; j++)
{
cin>>a.mat[i][j];
}
}
}
Matrix mat_mulvec(Matrix a,vector<ll> vec)
{
Matrix res;
for(int i=0;i<a.rowCount;i++)
{
for(int j = 0; j < a.colCount; j++)
{
res.mat[i][j]=a.mat[i][j]*vec[i];
}
}
res.rowCount=a.rowCount;
res.colCount=a.colCount;
return res;
}
//矩阵打印
void print_mat(Matrix res)
{
//cout<<"-------------------"<<endl;
for(int i = 0; i < res.rowCount; i++)
{
for(int j = 0; j < res.colCount; j++)
{
cout<<res.mat[i][j]<<" ";
}
cout<<endl;
}
}
int main()
{
int n,d;
Matrix Q,K,V,res;
cin>>n>>d;
read_mat(Q,n,d);
read_mat(K,n,d);
read_mat(V,n,d);
vector<ll> vec;
ll vect;
for(int i=0;i<n;i++)
{
cin>>vect;
vec.push_back(vect);
}
res=mat_mult(Q,mat_mult(mat_transpose(K),V));
print_mat(mat_mulvec(res,vec));
}
CCF-CSP认证 2023年6月02 矩阵运算
于 2024-06-01 09:37:13 首次发布