題目連結

思路
用字串模擬

然後要注意一點 它是連續的 才並在一起

就比如說

d, d1, d111, d113, d11231, d112213111, …

比如 d11231 -> d112213111

是 1個d 2 個 1 1 個 2 1 個 3 1 個 1

然後 並在一起就是

d112213111

而不是 d1132131

AC 程式碼

#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <cstdlib>
#include <cmath>
 

#include <climits>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <map>
#include <stack>
#include <set>
#include <numeric>
#include <sstream>
 

#include <iomanip>
#include <limits>

#define CLR(a) memset(a, 0, sizeof(a))
#define pb push_back

using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair<string
 
, int> psi;
typedef pair<string, string> pss;

const double PI = 3.14159265358979323846264338327;
const double E = exp(1);
const double eps = 1e-30;

const int INF = 0x3f3f3f3f;
const int maxn = 1e5 + 5;
const int MOD = 1e9 + 7;

string tran(string s)
{
    int len = s.size();
    string ans = "";
    char c = s[0];
    int num = 1;
    for (int i = 1; i < len; i++)
    {
        if (s[i] == c)
            num++;
        else
        {
            ans += c;
            ans += num + '0';
            c = s[i];
            num = 1;
        }
    }
    ans += c;
    ans += num + '0';
    return ans;
}

int main()
{
    string ans;
    cin >> ans;
    int n;
    cin >> n;
    for (int i = 1; i < n; i++)
        ans = tran(ans);
    cout << ans << endl;
}