动态规划;
代码:
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int m = sc.nextInt();
int n = sc.nextInt();
int[][] dp = new int[m+1][n+1];
sc.close();
for(int i = 1;i <= m;i++) {
for(int j = 1;j <= n;j++) {
if(i == 1) {
dp[i][j] = 1;
}
else if(j ==1) {
dp[i][j] = 1;
}
else {
dp[i][j] = dp[i-1][j] + dp[i][j-1];
}
}
}
System.out.println(dp[m][n]);
}
}