EularProject 15: 方格迷宫的路径数

Lattice paths

Starting in the top left corner of a 2×2 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 20×20 grid?

dict={}
def func(i,j):
    rest=dict.get(str(i)+'_'+str(j))
    if rest!=None:
        return rest
    else:
        if i==0 or j==0:
            return 1
        temp=func(i-1,j)+func(i,j-1)
        dict[str(i)+'_'+str(j)]=temp
        return temp

result=func(20,20)
print(result)

import operator
from functools import reduce

def c(n,k):
    return  reduce(operator.mul,range(n - k + 1, n + 1)) //reduce(operator.mul, range(1, k +1))

def fac(n):
    return reduce(operator.mul, range(1,n+1))

a,b=20,20
print(c(a+b,a))

time : <1s