整数划分

#include<bits/stdc++.h>
using namespace std;
long long t,n[21],n2;
long long n3[21][21],x;
long long son[1000][1000],f[21][21],m;
string n1;
int printf1(int a,int b){
    if(b==0)return 0;
    printf1(son[a][b],b-1);
    for(int i=son[a][b]+1;i<=a;i++)
        cout<<n[i];
    cout<<" ";
}
int main(){
    cin>>t;
    for(int l=1;l<=t;l++){
        memset(n,0,sizeof(n));
        memset(son,0,sizeof(son));
        cin>>n1>>m;
        n2=n1.length();
        for(int i=0;i<=n2;i++)
            for(int j=0;j<=n2;j++){
                f[i][j]=0;
                //n3[i][j]=1;
            }    
        f[0][0]=1;
        for(int i=1;i<=n2;i++){
            n[i]=n1[i-1]-‘0‘;
        }
        for(int i=1;i<=n2;i++){
            x=n[i];
            for(int j=i;j<=n2;j++){
                n3[i][j]=x;
                x*=10;
                x+=n[j+1];
            }
        }
        for(int i=1;i<=n2;i++){
            for(int j=1;j<=m&&j<=i;j++){
                for(int k=1;k<=i;k++){
                    if(f[i][j]<f[k-1][j-1]*n3[k][i]){
                        f[i][j]=f[k-1][j-1]*n3[k][i];
                        son[i][j]=k-1;
                    } 
                }
            }
        }
        printf("%lld\n",f[n2][m]);
        if(m==n2)
            for(int i=1;i<=n2;i++)
                cout<<n[i]<<" ";
        else printf1(n2,m);
        cout<<endl;
    }
}