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

import java.util.*;

public class Main{
    public static void main(String [] args){
        Scanner sc = new Scanner(System.in);
        String [] arr = sc.nextLine().split(" ");
        int n = Integer.parseInt(arr[0]);
        int m = Integer.parseInt(arr[1]);
        int[][] dp = new int[n+1][m+1];
        for(int i = 0; i<=n;i++){
            for(int j=0; j<=m;j++){
                if(j==0 || i==0){
                    dp[i][j] = 1;
                }else{
                    dp[i][j] = dp[i][j-1]+dp[i-1][j];
                }
            }
        }
        System.out.println(dp[n][m]);
        
        
    }
}