题解 | #放苹果#

def count_apples(m, n):
    #苹果数目从0到m,共m+1个值
    #边界条件
    dp = [[1] * (n+1) for _ in range(m+1)]
    #动态方程
    for i in range(2, m+1):
        for j in range(2, n+1):
            if i >= j:
                dp[i][j] = dp[i][j-1] + dp[i-j][j]
            else:
                dp[i][j] = dp[i][i]
    return dp[m][n]

m, n = list(map(int, input().split()))
res = count_apples(m, n)
print(res)