'commit'

TangDou/LanQiaoBei/LanQiao15STEMA20231217/9.cpp

@@ -0,0 +1,26 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+    string s;
+    cin >> s;
+
+    int m;
+    cin >> m;
+    m--;
+
+    while (m--) {
+        string t;
+        for (int i = 0; i < s.size(); i++) {
+            int c = 1;
+            while (i + 1 < s.size() && s[i + 1] == s[i]) {
+                c++;
+                i++;
+            }
+            t = t + to_string(c) + s[i];
+        }
+        s = t;
+    }
+    cout << s << endl;
+    return 0;
+}

TangDou/LanQiaoBei/LanQiao15STEMA20231217/试题.txt

@@ -0,0 +1 @@
+https://tiku.scratchor.com/paper/view/z8k4y0xsf0ue8xlh

TangDou/Test/TestA.cpp

@@ -1,27 +1,26 @@
 #include <bits/stdc++.h>
-
 using namespace std;
-/**
- 8
- 4 2
 
- 1
- 2 2
- 3 3 3
- 4 4 4 4
-*/
-int n, sum;
 int main() {
-    cin >> n;
+    string s;
-    for (int i = 1;; i++) {
+    cin >> s; 
-        n -= i;
+
-        if (n <= 0) {
+    int m;
-            // cout << i << " " << i + n << endl;
+    cin >> m;
-            sum += i * (i + n); // 最后一行
+    m--;
-            for (int j = 1; j < i; j++) sum += j * j;
+
-            cout << sum << endl;
+    while (m--) {
-            break;
+        string t;
+        for (int i = 0; i < s.size(); i++) {
+            int c = 1;
+            while (i + 1 < s.size() && s[i + 1] == s[i]) {
+                c++;
+                i++;
+            }
+            t = t + to_string(c) + s[i];
         }
+        s = t;
     }
+    cout << s << endl;
     return 0;
-}
+}