题解 | #走方格的方案数#

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

void async function () {
    let [n,m] = (await readline()).split(" ").map(item => Number(item)+1);
    let cnt = 0;
    const dfs = (i,j) => {
        if(i >= n || j >= m) return ;
        if(i === n-1 && j === m-1) return cnt ++;
        dfs(i+1,j);
        dfs(i,j+1);
    }
    dfs(0,0);
    console.log(cnt);
}()