![](https://i-blog.csdnimg.cn/blog_migrate/a490050e9239f2d0929e6fde5585efa5.png)
代码:
import os
import sys
# 请在此输入您的代码
# N = 11
# M = 2023
# f = [[0] * 2023 for i in range(11)]
# f[0][0] = 1
# for i in range(1,2023): #第一步正序遍历所有物品
# for j in range(10,0, -1): #第二步倒序遍历用了多少物品
# for k in range(i, 2023): #第三步遍历总和(这里就是2022)
# f[j][k] = f[j][k] +f[j-1][k-i] # 前i种物品,取j个物品(每种物品只有一个,该物品体积等于i),物品总体积等于k的总方案
# print(f[10][2022])
print(379187662194355221)
![](https://i-blog.csdnimg.cn/blog_migrate/ee77f90a18943074dfbbdc6a6d3a0a05.png)
代码:
import sys
import os
N,M = map(int,input().split())
list=[]
def fun(store,flower,wine):
if store>0:
fun(store-1,flower,wine*2)
if flower>0:
fun(store,flower-1,wine-1)
if store==0 and flower==1 and wine==1:
list.append(1)
return list
fun(N,M,2)
print(len(list))