题解 | 二维斐波那契数列c语言

#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#define MOD 1000000007
int main(){
    int a[1001][1001];
    int n, m;
    scanf("%d %d", &n, &m);

    for(int i = 1; i <= n; i++) {
        a[i][1] = 1;
    }
    for(int j = 1; j <= m; j++) {
        a[1][j] = 1;
    }

    for(int i = 2; i <= n; i++) {
        for(int j = 2; j <= m; j++) {
            a[i][j] = (a[i-1][j] + a[i][j-1]) % MOD;
        }
    }

    printf("%d", a[n][m]);
    return 0;
}