方阵形对角矩阵

DB_Question

　

解决：

　　1、存

　　2、验证

#include <iostream>
using namespace std;

//将小矩阵的值转存在一维数组b中
void TurnToB(int a[][16], int b[], int m, int t);
//关键的存放算法
void CoreStore(int b[], int x, int y, int val, int m);
//验证i，j到k是否正确，具体检验k是否能输出
void show(int b[], int i, int j, int m);

int main()
{
    int n = 16, m = 4, t = 4;//以16×16方阵为例
    int a[16][16];
    int b[64];//m*m*t
    //初始化特殊位置的值
    a[0][0] = 0, a[0][3] = 3, a[3][0] = 3;
    a[3][3] = 6, a[7][4] = 11, a[4][7] = 11;
    a[7][7] = 14, a[8][11] = 19, a[11][8] = 19;
    a[11][11] = 22, a[12][15] = 27, a[15][12] = 27;
    a[15][15] = 30, a[5][5] = 10, a[10][11] = 21;
    //-------------------------------------------
    TurnToB(a, b, m, t);
    //验证上一步算法的正确性
    show(b, 0, 0, m);
    show(b, 0, 3, m);
    show(b, 3, 0, m);
    show(b, 3, 3, m);

    show(b, 7, 4, m);
    show(b, 4, 7, m);
    show(b, 7, 7, m);
    show(b, 8, 11, m);

    show(b, 11, 8, m);
    show(b, 11, 11, m);
    show(b, 12, 15, m);
    show(b, 15, 12, m);

    show(b, 15, 15, m);
    show(b, 5, 5, m);
    show(b, 10, 11, m);

    return 0;
}
void TurnToB(int a[][16], int b[], int m, int t)
{
    int x, y;
    for (int i = 0; i < m; i++)
    {
        for (int j = 0; j < m; j++)
        {
            for (int k = 0; k < t; k++)
            {
                x = i + m*k;
                y = j + m*k;
                CoreStore(b, x, y, a[x][y], m);
            }
        }
    }
}
void CoreStore(int b[], int x, int y, int val, int m)
{
    int loc = (x / m)*m*m + (x%m)*m + y - (x / m)*m;
    b[loc] = val;
}
void show(int b[], int i, int j, int m)
{
    int loc = (i / m)*m*m + (i%m)*m + j - (i / m)*m;
    cout << "a[" << i << "][" << j << "]=b[" << loc << "]=" << b[loc] << endl;
}