题解 | 二维斐波那契数列

#include <stdio.h>

int main()
{
    int arr[1000][1000] = {0};
    int i = 0, j = 0;
    if(i == 0)
    {
        for(j = 0; j < 1000; j++)
        {
            arr[i][j] = 1;
            arr[j][i] = 1;
        }
    }
    int n = 0, m = 0;
    scanf("%d %d",&n,&m);
    for(i = 1; i < n; i++)
    {
        for(j = 1; j < m; j++)
        {
            (arr[i][j])
            = (arr[i-1][j]+arr[i][j-1])%(int)(1e9+7);
        }
    }
    printf("%d",arr[n-1][m-1]);
    return 0;
}