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

#include <iostream>
#include <vector>
using namespace std;

int main() {  
    int n , m;
    cin >> n;
    cin >> m;
    vector<vector<int>> dp(n+1,vector(m+1,0));
    for(int i = 0 ; i <= m ; i++){
        dp[0][i] = 1;
    }
    for(int j = 0 ; j <= n ; j++){
        dp[j][0] = 1;
    }
    for(int i = 1 ; i <= n ; i++){
        for(int j = 1 ; j <= m ; j++){
            dp[i][j] = dp[i-1][j] + dp[i][j-1];
        }
    }
     cout << dp[n][m];
   
}
// 64 位输出请用 printf("%lld")