题解 | 放苹果

def ways(m,n):
    if m == 0:
        return 1
    if n == 1:
        return 1
    if m < n:
        return ways(m,m)
    return ways(m,n - 1) + ways(m - n,n)

m,n = map(int,input().split())

print(ways(m,n))