题解 | #放苹果#

const rl = require("readline").createInterface({ input: process.stdin });
var iter = rl[Symbol.asyncIterator]();
const readline = async () => (await iter.next()).value;

void (async function () {
    let input = await readline();
    input = input.split(" ");
    let m = parseInt(input[0]);
    let n = parseInt(input[1]);
    let dp = new Array(m + 1).fill(0).map(() => new Array(n + 1).fill(0));
    // 初始化dp数组
    for (let i = 0; i <= n; i++) {
        dp[0][i] = 1;
    }
    for (let i = 0; i <= m; i++) {
        dp[i][1] = 1;
    }

    // 动态规划填表
    for (let i = 1; i <= m; i++) {
        for (let j = 2; j <= n; j++) {
            if (i < j) {
                dp[i][j] = dp[i][i];
            } else {
                dp[i][j] = dp[i][j - 1] + dp[i - j][j];
            }
        }
    }

    console.log(dp[m][n]);
})();