CSP202212-3

如何按照给定的规则输入矩阵喵？

while (num<=9)
    {
        for (int i = num - 1; i > 0 && n > 0; i--)
        {
            cin >> x;
            scan[i][num - i] = x;
            n--;
        }
        num++;
        for (int i = num - 1; i > 0 && n > 0; i--)
        {
            cin >> x;
            scan[num - i][i] = x;
            n--;
        }
        num++;
    }

如何按要求逆变换

double trans(double i, double j)
{
    double res = 0;
    for (int u = 0; u <= 7; u++)
        for (int v = 0; v <= 7; v++)
            if (u == 0 && v == 0)
                res += (double)M1[u][v] * cos(0) * cos(0) / 2.0;
            else if (u == 0)
                res += (double)M1[u][v] * sqrt(0.5) * cos(acos(-1) * (i + 0.5) * double(u) / 8.0) * cos(acos(-1) * (j + 0.5) * v / 8.0);
            else if (v == 0)
                res += (double)M1[u][v] * sqrt(0.5) * cos(acos(-1) * (i + 0.5) * double(u) / 8.0) * cos(acos(-1) * (j + 0.5) * v / 8.0);
            else
                res += (double)M1[u][v] * cos(acos(-1) * (i + 0.5) * double(u) / 8) * cos(acos(-1) * (j + 0.5) * double(v) / 8.0);

    return (double)res / 4.0;
}

借鉴了这位大佬的DCT函数：

https://blog.csdn.net/weixin_52303238/article/details/129358445?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522167931485916800184152310%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=167931485916800184152310&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~sobaiduend~default-2-129358445-null-null.142^v74^insert_down1,201^v4^add_ask,239^v2^insert_chatgpt&utm_term=csp202212-3&spm=1018.2226.3001.4187

本系列只是记录，会借鉴，望海涵