高斯消元

DongResponse

于 2020-05-15 11:28:13 发布

阅读量159

点赞数

本文链接：https://blog.csdn.net/dong_pope/article/details/106138271

版权

#include <cstdio>

using namespace std;

int n;
double a[105][105], b[105];

signed main() {
    scanf("%d", &n);//NOLINT
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++)scanf("%lf", &a[i][j]);//NOLINT
        scanf("%lf", &b[i]);//NOLINT
    }
    for (int i = 1; i <= n; i++) {
        for (int k = i; k <= n; k++) {
            double tmp = a[k][i];
            if (tmp == 0) {
                printf("No Solution");
                return 0;
            }
            for (int j = i; j <= n; j++)a[k][j] /= tmp;
            b[k] /= tmp;
        }
        for (int k = i + 1; k <= n; k++) {
            for (int j = i; j <= n; j++)a[k][j] -= a[i][j];
            b[k] -= b[i];
        }
    }
    for (int i = n; i >= 1; i--) {
        for (int k = i - 1; k >= 1; k--) {
            double tmp = a[k][i];
            for (int j = 1; j <= n; j++)a[k][j] -= tmp * a[i][j];
            b[k] -= tmp * b[i];
        }
    }
    for (int i = 1; i <= n; i++)printf("%.2lf\n", b[i]);
    return 0;
}