矩阵的相乘采用指针的方法，并且写出它的流程图和思路分析

#include <stdio.h>
int main()
{
    int i, j, k;
    int p[3][2] = { {2,-6},{3,5},{1,-1} }, q[2][4] = { {4,-2,-4,-5},{-7,-3,6,7} }, r[3][4] = { 0 };
    int left = 0, right = 0;
    for (i = 0; i < 3; i++)
    {
        for (j = 0; j < 4; j++)
        {
            r[i][j] = 0;
            for (k = 0; k < 2; k++)
            {
                left = *(*(p + i) + k);
                right = *(*(q + k) + j);
                r[i][j] += left * right;
            }
        }
    }
    for (i = 0; i < 3; i++)
    {
        for (j = 0; j < 4; j++)
        {
            printf("%d ", r[i][j]);
        }
        printf("\n");
    }
    return 0;
}

 觉得有用的话采纳一下哈