听说大家都用动态规划来解决,我不懂动态规划,用了类似斐波那契数列的办法,因为只能向右或向下移动,所以到(i,j)的路径 ans[i][j]=ans[i-1][j]+ans[i][j-1]。
话不多说直接贴上代码
package demo;
import java.util.Scanner;
class Main{
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n,m,x,y;
n = scan.nextInt();
m = scan.nextInt();
x = scan.nextInt();
y = scan.nextInt();
int[][] map = new int [21][21];
long[][] ans = new long [21]