高斯消元法模板题

链接
AC代码

#include <bits/stdc++.h>
inline long long read(){char c = getchar();long long x = 0,s = 1;
while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}
while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}
return x*s;}
using namespace std;
#define NewNode (TreeNode *)malloc(sizeof(TreeNode))
#define Mem(a,b) memset(a,b,sizeof(a))
#define lowbit(x) (x)&(-x)
const int N = 2e5 + 10;
const long long INFINF = 0x7f7f7f7f7f7f7f;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-5;
const int mod = 1e9+7;
const double II = acos(-1);
const double PP = (II*1.0)/(180.00);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> piil;
signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    //    freopen("input.txt","r",stdin);
    //    freopen("output.txt","w",stdout);
    int n,ans = 1;
    cin >> n;
    double arr[n+5][n+5];
    for(int i = 1;i <= n;i++)
        for(int j = 1;j <= n+1;j++)
            cin >> arr[i][j];
    for(int i = 1;i <= n;i++)
    {
        int pos = i;
        for(int j = i+1;j <= n;j++)
            if(fabs(arr[j][i]) > fabs(arr[pos][i]))
                pos = j;
        for(int j = i;j <= n+1;j++)
            swap(arr[pos][j],arr[i][j]);
        for(int j = i+1;j <= n;j++)
        {
            double num = arr[j][i]/arr[i][i];
            for(int k = i;k <= n+1;k++)
                arr[j][k] -= arr[i][k]*num;
        }
    }
    for(int i = 1;i <= n;i++)
        if(fabs(arr[i][i]) <= 1e-16)
            ans = 0;
    if(!ans) {cout << "No Solution" << endl;return 0;}
    for(int i = n;i >= 1;i--)
    {
        for(int j = i+1;j <= n;j++)
            arr[i][n+1] -= arr[i][j]*arr[j][n+1];
        arr[i][n+1] /= arr[i][i];
    }
    for(int i = 1;i <= n;i++)
        cout << fixed << setprecision(2) << arr[i][n+1] << endl;
}