题解 | #放苹果#

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

void (async function () {
    // Write your code here
    while ((line = await readline())) {
        let [m, n] = line.split(" ").map(Number);
        if(n > m) n=m;
        let dp = Array.from(Array(n+1), () => new Array(m+1).fill(1));

        for (let i = 2; i <=n; i++) {
            for (let j = 2; j <=m; j++) {
                if(i > j){
                    dp[i][j] = dp[j][j]; 
                }else{
                    dp[i][j] = dp[i][j - i] + dp[i -1][j];
                }
                
            }
        }
        console.log(dp[n][m])
     

    }
   
})();

稍微改进了一点算法，将坐标轴变成n个盘子，m个苹果。可以减少循环次数