高斯消元

高斯消元其实就是个模拟……想想初中怎么学的加减消元，模拟这个过程就好了。
主要看看代码里的一些技巧。

Code

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>

const int maxn = 107;
const double eps = 1e-7;

using namespace std;

double a[maxn][maxn];
double ans[maxn];

inline int read()
{
    int X = 0, w = 1; char ch = getchar();
    while (ch < '0' || ch > '9') { if (ch == '-') w = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') X = X * 10 + ch - '0', ch = getchar();
    return X * w;
}

int main(void)
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n + 1; j++) a[i][j] = read();
    for (int i = 1; i <= n; i++) {
        int r = i;
        for (int j = i + 1; j <= n; j++) if (fabs(a[j][i]) > fabs(a[r][i])) r = j; //这个每次找最大的貌似是为了降低精度误差
        if (fabs(a[r][i]) < eps) {
            printf("No Solution");
            return 0;
        }
        if (r != i) swap(a[r], a[i]);
        double ai = a[i][i];
        for (int j = i; j <= n + 1; j++) a[i][j] /= ai;
        for (int j = i + 1; j <= n; j++) {
            ai = a[j][i];
            for (int k = i; k <= n + 1; k++) a[j][k] -= ai * a[i][k];
        }
    }
    ans[n] = a[n][n + 1];
    for (int i = n - 1; i; i--) {
        ans[i] = a[i][n + 1];
        for (int j = i + 1; j <= n; j++) ans[i] -= a[i][j] * ans[j];
    }
    for (int i = 1; i <= n; i++) printf("%.2lf\n", ans[i]);

    return 0;
}