参考答案：

#include<iostream>
#include<algorithm>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1010;
int a[N][N];
int main()
{
    int n;
    cin >> n;
    a[1][1] = 1;
    cout << a[1][1] << endl;
    for (int i = 2; i <= n; ++i)
    {
        for (int j = 1; j <= i; ++j)
        {
            a[i][j] = (a[i - 1][j - 1] + a[i - 1][j]) % mod;
            printf("%d ", a[i][j]);
        }
        printf("\n");
    }
    return 0;
}