From 35cf21675353e1893e987bfa58c0df29786427ea Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=BB=84=E6=B5=B7?= <10402852@qq.com>
Date: Sun, 14 Apr 2024 09:57:46 +0800
Subject: [PATCH] 'commit'

---
 GESP/New_WuHouFenTao_1.cpp | 19 +++++++++++++++++++
 GESP/New_WuHouFenTao_2.cpp | 19 +++++++++++++++++++
 GESP/New_WuHouFenTao_3.cpp | 20 ++++++++++++++++++++
 3 files changed, 58 insertions(+)
 create mode 100644 GESP/New_WuHouFenTao_1.cpp
 create mode 100644 GESP/New_WuHouFenTao_2.cpp
 create mode 100644 GESP/New_WuHouFenTao_3.cpp

diff --git a/GESP/New_WuHouFenTao_1.cpp b/GESP/New_WuHouFenTao_1.cpp
new file mode 100644
index 0000000..f2b7236
--- /dev/null
+++ b/GESP/New_WuHouFenTao_1.cpp
@@ -0,0 +1,19 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+    int i, j;
+    for (i = 1;; i++) {
+        int x = i;
+        for (j = 0; j < 5; j++) {
+            if ((x - 1) % 5 != 0 || x <= 1) // 扔掉一个是否能分成5份
+                break;                      // 不符合要求
+            x = (x - 1) / 5 * 4;            // 分完第j+1次后剩下的桃子
+        }
+        if (j == 5) { // 符合条件
+            printf("%d", i);
+            exit(0);
+        }
+    }
+    return 0;
+}
diff --git a/GESP/New_WuHouFenTao_2.cpp b/GESP/New_WuHouFenTao_2.cpp
new file mode 100644
index 0000000..9275763
--- /dev/null
+++ b/GESP/New_WuHouFenTao_2.cpp
@@ -0,0 +1,19 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+    int i, j;
+    for (i = 6;; i += 5) {
+        int x = i;
+        for (j = 0; j < 5; j++) {
+            if ((x - 1) % 5 != 0 || x <= 1) // 扔掉一个是否能分成5份
+                break;                      // 不符合要求
+            x = (x - 1) / 5 * 4;            // 分完第j+1次后剩下的桃子
+        }
+        if (j == 5) { // 符合条件
+            printf("%d", i);
+            exit(0);
+        }
+    }
+    return 0;
+}
diff --git a/GESP/New_WuHouFenTao_3.cpp b/GESP/New_WuHouFenTao_3.cpp
new file mode 100644
index 0000000..266600e
--- /dev/null
+++ b/GESP/New_WuHouFenTao_3.cpp
@@ -0,0 +1,20 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+    // 倒推
+    int x; // 目前计算出的原来桃子的总数量
+    int i = 0;
+    int j = 1; // 最后一个猴子分得的桃子数量为4的j倍
+    while (i < 5) {
+        x = 4 * j;
+        for (i = 0; i < 5; i++) {
+            if (x % 4 != 0) { break; }
+            x = (x / 4) * 5 + 1;
+        }
+        j++;
+    }
+    printf("%d\n", x);
+
+    return 0;
+}