1140 Look-and-say Sequence (20 分)

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define ull unsigned long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)

#define base 2333
const int mod=1e9+7;
const int maxn=42;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int m,n;
string s[maxn];
void add(int x,char c,int y){
    s[x]+=c;
    string tp="";
    while(y){
        char c='0'+(y%10);
        tp+=c,y/=10;
    }
    tp.reserve();
    s[x]+=tp;
    return;
}
int main(){
    ios::sync_with_stdio(false);
    cin>>m>>n;
    char c='0'+m;
    s[0]="",s[0]+=c;
    rep(i,0,n-1){
        s[i+1]="";
        int v,cnt=0;
        for(int j=0;j<s[i].size();j++){
            cnt=1;
            while(j+1<s[i].size()&&s[i][j+1]==s[i][j]) j++,cnt++;
            ///cout<<s[i][j]<<" "<<cnt<<endl;
            add(i+1,s[i][j],cnt);
        }
        ///cout<<s[i]<<endl;
    }
    cout<<s[n-1]<<endl;

    return 0;
}