题解 | 二维斐波那契数列

#include <stdio.h>
#include <stdlib.h>

const int mod = 1e9 + 7;
const int max = 1001;

int main() {
    int n, m;
    scanf("%d%d", &n, &m);
    int dp[max][max];
    for (int j = 1; j <= m; j++)
        dp[1][j] = 1;
    for (int i = 1; i <= n; i++)
        dp[i][1] = 1;
    for (int i = 2; i <= n; i++)
        for (int j = 2; j <= m; j++)
            dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % mod;
    printf("%d\n", dp[n][m]);

    return 0;
}

}