只要懂如何进行矩阵乘法就好了，和注意一点数的大小范围就ok了！

#include <iostream>
using namespace std;

const int N = 10010, D = 30;
long long tmp[D][D], ans[N][N];
int n, d;
int Q[N][D], K[N][D], V[N][D], W[N];
int main()
{
    cin >> n >> d;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= d; j++)
            cin >> Q[i][j];
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= d; j++)
            cin >> K[i][j];
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= d; j++)
            cin >> V[i][j];
    for (int i = 1; i <= n; i++) cin >> W[i];

    // 计算 K的转置 * V 
    for (int i = 1; i <= d; i++)
        for (int j = 1; j <= d; j++)
            for (int k = 1; k <= n; k++)
                tmp[i][j] += K[k][i] * V[k][j];

    // 计算 Q * tmp 
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= d; j++)
        {
            for (int k = 1; k <= d; k++)
                ans[i][j] += Q[i][k] * tmp[k][j];
            ans[i][j] *= (long long)W[i];
        }

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= d; j++)
            cout << ans[i][j] << " ";
        cout << endl;
    }
    system("pause");
    return 0;
}