题解 | #放苹果#

while True:
    try:
        m, n = list(map(int, input().split()))
        dp = [[0] * (n+1) for _ in range(m+1)]
        for i in range(m+1):
            dp[i][1] = 1 # 1个盘子
        for j in range(1, n+1):
            dp[0][j] = 1 # 0个苹果
        for i in range(1, m+1):
            for j in range(2, n+1):
                if i < j:
                    dp[i][j] = dp[i][i]
                else:
                    dp[i][j] = dp[i-j][j] + dp[i][j-1]
        print(dp[m][n])
    except:
        break