From e6bc29d81cdbe77fca47a952b9e3e56f25b7810b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=BB=84=E6=B5=B7?= <10402852@qq.com>
Date: Thu, 25 Apr 2024 19:54:28 +0800
Subject: [PATCH] 'commit'

---
 GESP/20231201.cpp          |  2 +-
 GESP/20231202.cpp          | 32 ++++++++++++++++++++++++++++++++
 GESP/New_WuHouFenTao_1.cpp | 14 ++++++++------
 GESP/New_WuHouFenTao_3.cpp | 25 +++++++++++++++++++++++++
 GESP/Test.cpp              | 34 ++++++++++++++++++++++++++++++++--
 5 files changed, 98 insertions(+), 9 deletions(-)
 create mode 100644 GESP/20231202.cpp
 create mode 100644 GESP/New_WuHouFenTao_3.cpp

diff --git a/GESP/20231201.cpp b/GESP/20231201.cpp
index 6ada647..e5bf980 100644
--- a/GESP/20231201.cpp
+++ b/GESP/20231201.cpp
@@ -10,7 +10,7 @@ int main() {
         for (j = 0; j < n; j++) {
             if ((tmp - x) % n != 0 || tmp <= x)
                 break;
-            tmp = (tmp - x) / n * (n-1);
+            tmp = (tmp - x) / n * (n - 1);
         }
         if (j == n) {
             printf("%d\n", i);
diff --git a/GESP/20231202.cpp b/GESP/20231202.cpp
new file mode 100644
index 0000000..ff2d4e0
--- /dev/null
+++ b/GESP/20231202.cpp
@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+/**
+2
+1 km = ? mm
+1 m = ? mm
+*/
+int main() {
+    int m;
+    cin >> m;
+    while (m--) {
+        int a;
+        cin >> a; // 第一个数字
+        string b;
+        cin >> b;      // 第一个单位
+        string c, d;   // 等号与问号
+        cin >> c >> d; // 用不上，只读不用
+        string e;
+        cin >> e; // 第二个单位
+
+        if (b[0] == 'k') {
+            if (e.size() == 1)
+                cout << a << " " << b << " = " << a * 1000 << e << endl;
+            else
+                cout << a << " " << b << " = " << a * 1000000 << e << endl;
+        } else {
+            cout << a << " " << b << " = " << a * 1000 << e << endl;
+        }
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/GESP/New_WuHouFenTao_1.cpp b/GESP/New_WuHouFenTao_1.cpp
index f2b7236..69156b8 100644
--- a/GESP/New_WuHouFenTao_1.cpp
+++ b/GESP/New_WuHouFenTao_1.cpp
@@ -1,14 +1,16 @@
 #include <bits/stdc++.h>
 using namespace std;
-
+// 5只猴子，需要多少个桃子3121
+//
+// 6只猴子，
 int main() {
-    int i, j;
-    for (i = 1;; i++) {
-        int x = i;
-        for (j = 0; j < 5; j++) {
+    for (int i = 6;; i += 5) { // 逐个尝试有i个桃子
+        int x = i;             // 拷贝出来，防止错误的修改
+        int j;
+        for (j = 0; j < 5; j++) {           // 尝试5个猴子分5回
             if ((x - 1) % 5 != 0 || x <= 1) // 扔掉一个是否能分成5份
                 break;                      // 不符合要求
-            x = (x - 1) / 5 * 4;            // 分完第j+1次后剩下的桃子
+            x = (x - 1) * 4 / 5;            // 分完第j+1次后剩下的桃子
         }
         if (j == 5) { // 符合条件
             printf("%d", i);
diff --git a/GESP/New_WuHouFenTao_3.cpp b/GESP/New_WuHouFenTao_3.cpp
new file mode 100644
index 0000000..9848698
--- /dev/null
+++ b/GESP/New_WuHouFenTao_3.cpp
@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+using namespace std;
+int i, j;
+// 5只猴子，需要多少个桃子3121
+// 6只猴子，需要多少个桃子46651
+// 7只猴子，需要多少个桃子823537
+// 8只猴子，需要多少个桃子16777209
+// 9只猴子，需要多少个桃子682153588
+int main() {
+    int m, q;
+    cin >> m >> q;
+    for (i = 1;; i++) {                     // 逐个尝试有i个桃子
+        int x = i;                          // 拷贝出来，防止错误的修改
+        for (j = 0; j < m; j++) {           // 尝试5个猴子分5回
+            if ((x - q) % m != 0 || x <= q) // 扔掉一个是否能分成5份
+                break;                      // 不符合要求
+            x = (x - q) * (m - 1) / m;      // 分完第j+1次后剩下的桃子
+        }
+        if (j == m) { // 符合条件
+            printf("%d", i);
+            exit(0);
+        }
+    }
+    return 0;
+}
diff --git a/GESP/Test.cpp b/GESP/Test.cpp
index 93dfdde..27d78b7 100644
--- a/GESP/Test.cpp
+++ b/GESP/Test.cpp
@@ -1,7 +1,37 @@
 #include <bits/stdc++.h>
 using namespace std;
 int main() {
-    int list[10] = {1};
-    cout << list;
+    int T;
+    cin >> T;
+    while (T--) {
+        int a;
+        cin >> a;
+        string dw;
+        cin >> dw;
+        char dh;
+        cin >> dh;
+        char wh;
+        cin >> wh;
+        string dw2;
+        cin >> dw2;
+        int sum = 0;
+        // 我天~可算是录完了
+
+        if (dw == "m")
+            sum = a * 1000;
+        else if (dw == "km" && dw2 == "mm")
+            sum = a * 1000000;
+        else if(dw=="km"&&dw2=="m")
+            sum = a * 1000;
+        else if(dw=="kg"&&dw2=="mg")
+            sum = a * 1000000;
+        else if(dw=="kg"&&dw2=="g")
+            sum = a * 1000;
+        else if(dw=="g")
+            sum = a * 1000;
+            //计算完成！！
+
+        cout << a << " " << dw << " = " <<sum<<" "<< dw2 << endl;
+    }
     return 0;
 }
\ No newline at end of file