题解 | #放苹果#

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(m<n) n=m;

        let dp = Array.from(Array(m+1), () => new Array(n+1).fill(1));

        for (let i = 2; 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])

    }
   
})();

需要使用动态规划的思路去求解

1.搞清楚边界条件和状态转移方程

2.需要多一行一列来存放初始值1