From 654ec109e564f9877f94d9ff10ceb76e7a2f3b24 Mon Sep 17 00:00:00 2001
From: Baoshuo <i@baoshuo.ren>
Date: Sat, 7 May 2022 21:44:23 +0800
Subject: [PATCH] =?UTF-8?q?883.=20=E9=AB=98=E6=96=AF=E6=B6=88=E5=85=83?=
 =?UTF-8?q?=E8=A7=A3=E7=BA=BF=E6=80=A7=E6=96=B9=E7=A8=8B=E7=BB=84?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

https://www.acwing.com/problem/content/submission/code_detail/14020513/
---
 AcWing/883/883.cpp    | 96 +++++++++++++++++++++++++++++++++++++++++++
 AcWing/883/data/9.ans |  3 ++
 AcWing/883/data/9.in  |  3 ++
 3 files changed, 102 insertions(+)
 create mode 100644 AcWing/883/883.cpp
 create mode 100644 AcWing/883/data/9.ans
 create mode 100644 AcWing/883/data/9.in

diff --git a/AcWing/883/883.cpp b/AcWing/883/883.cpp
new file mode 100644
index 00000000..94366cd2
--- /dev/null
+++ b/AcWing/883/883.cpp
@@ -0,0 +1,96 @@
+#include <cmath>
+#include <iomanip>
+#include <iostream>
+
+using std::cin;
+using std::cout;
+const char endl = '\n';
+
+const int N = 105;
+const double eps = 1e-6;
+
+int n;
+double a[N][N];
+
+int gauss() {
+    int c, r;
+
+    for (c = 1, r = 1; c <= n; c++) {
+        // 找到绝对值最大的一行
+        int t = r;
+        for (int i = r; i <= n; i++) {
+            if (std::abs(a[i][c]) > std::abs(a[t][c])) t = i;
+        }
+
+        // 非零
+        if (std::abs(a[t][c]) < eps) continue;
+
+        // 将该行移至顶部
+        for (int i = c; i <= n + 1; i++) {
+            std::swap(a[t][i], a[r][i]);
+        }
+
+        // 将该行第一个非零的数变成 1
+        for (int i = n + 1; i >= c; i--) {
+            a[r][i] /= a[r][c];
+        }
+
+        // 将下方所有行的第 c 列变成 0
+        for (int i = r + 1; i <= n; i++) {
+            if (std::abs(a[i][c]) > eps) {  // 非零
+                for (int j = n + 1; j >= c; j--) {
+                    a[i][j] -= a[r][j] * a[i][c];
+                }
+            }
+        }
+
+        r++;
+    }
+
+    if (r <= n) {
+        for (int i = r; i <= n; i++) {
+            if (std::abs(a[i][n + 1]) > eps)
+                // 无解
+                return -1;
+        }
+
+        // 无穷多组解
+        return 1;
+    }
+
+    // 将系数矩阵化为对角矩阵
+    for (int i = n; i; i--) {
+        for (int j = i + 1; j <= n; j++) {
+            a[i][n + 1] -= a[i][j] * a[j][n + 1];
+        }
+    }
+
+    // 有解
+    return 0;
+}
+
+int main() {
+    std::ios::sync_with_stdio(false);
+
+    cin >> n;
+    for (int i = 1; i <= n; i++) {
+        for (int j = 1; j <= n + 1; j++) {
+            cin >> a[i][j];
+        }
+    }
+
+    int r = gauss();
+
+    if (r == 0) {
+        for (int i = 1; i <= n; i++) {
+            if (std::abs(a[i][n + 1]) < eps) a[i][n + 1] = 0;
+            cout << std::fixed << std::setprecision(2) << a[i][n + 1] << endl;
+        }
+    } else if (r == 1) {
+        cout << "Infinite group solutions" << endl;
+    } else {  // r == -1
+        cout << "No solution" << endl;
+    }
+
+    return 0;
+}
diff --git a/AcWing/883/data/9.ans b/AcWing/883/data/9.ans
new file mode 100644
index 00000000..b460de54
--- /dev/null
+++ b/AcWing/883/data/9.ans
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4ae85f18ac0512d41819c9a9574110a0fc44523371575c1565514c2ef7f8059c
+size 25
diff --git a/AcWing/883/data/9.in b/AcWing/883/data/9.in
new file mode 100644
index 00000000..0e79c129
--- /dev/null
+++ b/AcWing/883/data/9.in
@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:f53d8d964a59d13e920c9d994896cdafcfa5c3078697bee013913219ca92b9ea
+size 66