题解 | 二维斐波那契数列

#include <stdio.h>

int main() {
    
    int a, b, ax, bx;
    scanf("%d %d", &a, &b);
    int arr[a][b];
    for (int i = 0; i < a; i++) {
        arr[i][0] = 1;
    }
    for (int j = 0; j < b; j++) {
        arr[0][j] = 1;
    }
    for (int k = 1; k < a; k++)
    {
        for (int l = 1; l < b; l++) 
        {
            arr[k][l] = (arr[k-1][l] + arr[k][l-1]) % (1000000000 + 7);
        }
    }
    printf("%d", arr[a-1][b-1]);
    return 0;
}