题解 | 二维斐波那契数列
二维斐波那契数列
https://www.nowcoder.com/practice/a1951ca9431646ff8f9bc6f6d24d1e0a
import sys
def fb(i, j):
fbnq = [[0] * (j+1) for _ in range(i+1)]
for m in range(1, i+1):
for n in range(1, j+1):
if m ==1 or n == 1:
fbnq[m][n] = 1
else:
fbnq[m][n] = int((fbnq[m-1][n] + fbnq[m][n-1]) % (1e9 +7))
return fbnq[i][j]
i, j = map(int, input().split())
print(fb(i,j))
哔哩哔哩公司福利 736人发布