解法
完全背包+大数。。。不想写大数了放个python得了
代码
dp=[0 for i in range(2000)]
n,k=map(int,input().split())
num=[i for i in range(1,k+1)]
dp[0]=1
for i in range(k):for j in range(num[i],n+1):dp[j]+=dp[j-num[i]]
print(dp[n])转载于:https://www.cnblogs.com/baccano-acmer/p/10241173.html
 导出出现无法访问已关闭的流)
![[Pytorch]Pytorch的tensor变量类型转换](http://pic.xiahunao.cn/[Pytorch]Pytorch的tensor变量类型转换)
_闭包)
