蓝桥杯 基础练习 杨辉三角形

#include <iostream>
using namespace std;
const int MAXN = 40;
int n;
int a[MAXN][MAXN];
int main()
{
    cin >> n;
    a[0][0] = 1;
    for (int i = 0; i < n; ++i)
    {
        a[i][0] = a[i][i] = 1;
        for (int j = 1; j < i; ++j)
            a[i][j] = a[i-1][j-1] + a[i-1][j];
    }
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j <= i; ++j)
            cout << a[i][j] << " ";
        cout << endl;
    }
    return 0;
}