列主元Gauss消去法C++实现

直接上代码吧，就一百多行

/*************************
* 2020.10.17
* 列主元 Gauss消去法
*************************/
#include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;
#define M 9
#define N 9

int main()
{
    int i = 0, j = 0, k = 0, t = 0;
    float matrix[M][N + 1] = { 0 }, result[M] = { 0 }, solution[M] = { 0 };
    float max = 0;
    cout << "Enter the value of the matrix: " << endl;
    for (i = 0;i < M;i++)
    {
        for (j = 0;j < N;j++)
            cin >> matrix[i][j];
    }
    cout << "Matrix: " << endl;
    for (i = 0;i < M;i++)//输出矩阵检查一下
    {
        for (j = 0;j < N;j++)
        {
            cout << matrix[i][j] << " ";
        }
        cout << endl;
    }

    cout << "Enter the value of the result: " << endl;
    for (i = 0;i < M;i++)
    {
        cin >> result[i];
        matrix[i][M] = result[i];//扩展成增广矩阵
    }
    cout << "result: " << endl;
    for (i = 0;i < M;i++)
    {
        cout << result[i] << " ";
    }
    cout << endl;

    //通用写法：列主元Gauss消去法 
    for (k = 0;k < M - 1;k++)//M行矩阵，要消元M-1次，k为消元次数
    {
        //先进行最大行调位
        
        t = k + 1;
        max = matrix[k][k];
        for (i = k + 1;i < M;i++)
        {
            if (matrix[i][k] > max)
            {
                t = i;
                max = matrix[i][k];
            }
        }
        if (t != k + 1)//如果需要调换
        {
            float temp = 0;
            for (j = k;j < N + 1;j++)
            {
                temp = matrix[k][j];
                matrix[k][j] = matrix[t][j];
                matrix[t][j] = temp;
            }
        }

        //再进行消元
        float lk = 0;//lk为消元系数
        for (i = k + 1;i < M;i++)
        {
            lk = -1 * matrix[i][k] / matrix[k][k];
            for (j = k;j < N + 1;j++)
            {
                matrix[i][j] = matrix[i][j] + lk * matrix[k][j];
            }
        }

        cout << "Matrix  " << k + 1 << endl;
        for (i = 0;i < M;i++)//输出矩阵检查一下
        {
            for (j = 0;j < N + 1;j++)
            {
                cout << matrix[i][j] << " ";
            }
            cout << endl;
        }
    }

    //最后求解方程组
    for (i = 0;i < M;i++)
    {
        result[i] = matrix[i][M];//最后一列存储一下，方便后面调用
    }
    for (i = 0;i < M;i++)
    {
        if (i == 0)
        {
            solution[M - 1] = result[M - 1] / matrix[M - 1][N - 1];
        }
        else//i=1
        {
            for (j = 0;j < i;j++)
            {
                result[M - 1 - i] = result[M - 1 - i] - solution[M - 1 - j] * matrix[M - 1 - i][N - 1 - j];
            }
            solution[M - 1 - i] = result[M - 1 - i] / matrix[M - 1 - i][N - 1 - i];
        }
    }
    cout << "Solution: " << endl;
    cout.precision(5);
    for (i = 0;i < M;i++)
    {
        cout << solution[i] << " ";
    }

    return 0;

}