（Problem 15）Lattice paths

Starting in the top left corner of a 22 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.

How many such routes are there through a 2020 grid?

题目大意：

从一个22网格的左上角开始，有6条（不允许往回走）通往右下角的路。

对于2020的网格，这样的路有多少条？

// （Problem 15）Lattice paths

// Completed on Tue, 11 Feb 2014, 23:58

// Language: VC++2010

//

// 版权所有（C）acutus   (mail: acutus@126.com)

// 博客地址：http://www.cnblogs.com/acutus/

#include<iostream>

#include<cmath>

using namespace std;

long long a[][];

int main()

{

    int i;

    for(i = ; i < ; i++)

    {

        a[][i] = ;

        a[i][] = ;

    }

    for (i = ; i < ; i++)

        for (int j = ; j < ; j++)

            a[i][j] = a[i][j-] + a[i-][j];

    cout<<a[][]<<endl;

    return ;

}

Answer:

137846528820

巴特西

（Problem 15）Lattice paths

最新文章

热门文章