#recursiondefdo_func(n,m):if(n == 1):
return m+1elif (m==1):
return n+1else:
return do_func(n-1,m)+do_func(n-1,m-1)
deffunc(n):#this function is to make the user understand easierreturn do_func(n-1,n-1)
#dynamic plandefdo_func2(n,m):
F = [([0]*m) for i in range(n)]
for k in range(1,n):
F[1][k] = k+1
F[k][1] = k+1for i in range(2,n):
for j in range(2,m):
F[i][j] = F[i-1][j]+ F[i-1][j-1]
return F[n-1][m-1]
deffunc2(n):return do_func2(n,n)