题解 | #放苹果#

# 20240622
# 函数f(m,n)表示把m个苹果放进n个盘子的方法总数
def f(m,n):
    if m < 0 or n < 0:
        return 0
    elif m == 1 or n == 1:
        return 1
    else:
        return f(m,n-1) + f(m-n,n)
m,n = map(int,input().split())
print(f(m,n))