Dollar Dayz---多重背包+拼接

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
typedef long long int  ll;
using namespace std;
ll a[1005],b[1005];
int main()
{
    int n,k;
    cin>>n>>k;
    ll inf = 1;
    for(int i = 0 ;i<18 ;i++)
        inf*=10;
    a[0] = 1 ;
    for(int i =1 ;i<= k ;i++)
        for(int j =0 ;j<=n;j++)
        {
            if(j<i)
                continue;
            b[j] = b[j]+b[j-i]+(a[j]-a[i])/inf;
            a[j] = (a[j]+a[j-i])%inf;
        }
    if(b[n])
        cout<<b[n];
    cout<<a[n]<<endl;

    
}