From f7a8f3f7c5850b008ab177fd604eb27d70588bdf Mon Sep 17 00:00:00 2001
From: Baoshuo <i@baoshuo.ren>
Date: Mon, 12 Sep 2022 21:35:53 +0800
Subject: [PATCH] =?UTF-8?q?1991=20-=20=E9=93=81=E6=86=A8=E6=86=A8=E9=AA=91?=
 =?UTF-8?q?=E5=A3=AB=E5=9B=A2=E7=9A=84=E8=AF=BE=E5=90=8E=E4=B9=A0=E9=A2=98?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

77473
---
 bjtu/1991/1991.cpp | 64 ++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 64 insertions(+)
 create mode 100644 bjtu/1991/1991.cpp

diff --git a/bjtu/1991/1991.cpp b/bjtu/1991/1991.cpp
new file mode 100644
index 00000000..fcefbae2
--- /dev/null
+++ b/bjtu/1991/1991.cpp
@@ -0,0 +1,64 @@
+#include <iostream>
+#include <numeric>
+#include <vector>
+
+using std::cin;
+using std::cout;
+const char endl = '\n';
+
+bool is_prime(int x) {
+    if (x <= 1) return false;
+
+    for (int i = 2; i * i <= x; i++) {
+        if (x % i == 0) {
+            return false;
+        }
+    }
+
+    return true;
+}
+
+int main() {
+    std::ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int n, t;
+    std::vector<int> p;
+
+    cin >> n;
+
+    if (is_prime(n)) {
+        cout << "NO" << endl;
+
+        exit(0);
+    }
+
+    t = n;
+
+    for (int i = 2; i * i <= t; i++) {
+        while (t % i == 0) {
+            p.emplace_back(i);
+            t /= i;
+        }
+    }
+
+    if (t > 1) p.emplace_back(t);
+
+    int sum = std::accumulate(p.begin(), p.end(), 0);
+
+    cout << "YES" << endl
+         << static_cast<int>(p.size()) + (n - sum) << endl;
+
+    for (const int& x : p) {
+        cout << x << ' ';
+    }
+
+    while (sum < n) {
+        cout << 1 << ' ';
+        sum++;
+    }
+
+    cout << endl;
+
+    return 0;
+}