欧拉计划Problem_15

算法思想：

C#

#include <stdio.h>
long long arr[20][20] = {};
int main(){
    arr[0][0] = 0;
    for(int x=0;x<20;x++){
        for(int y=0;y<20;y++){
            if(x==0 || y==0) arr[x][y] = 1;
            else arr[x][y] = arr[x-1][y] + arr[x][y-1];
        }
    }
    printf("%lld",arr[19][19]);
}

JAVA

package exercise;

public class _网格路径 {

	public static void main(String[] args) {
		long a[][] = new long[21][21];
		for(int i = 1;i < 21; i++) {
			for(int j = 1;j < 21;j++) {
				if(i == 1 && j == 1) {
					a[i][j] = 1;
				}
				else {
					a[i][j] = a[i-1][j] + a[i][j-1];
				}
			}
		}
		System.out.println(a[20][20]);
	}
}