题解 | 杨辉三角

#include <iostream>
using namespace std;

int main() {
    int n, a[34][34] = {0};
    cin >> n;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (j <= i) {
                if (j == 0) {
                    a[i][j] = 1;
                } else {
                    a[i][j] = a[i-1][j] + a[i-1][j-1];
                    }
                cout << a[i][j];
                if (j != i) {
                    cout << " ";
                }
            }
        }
        cout<<endl;
    }
}
// 64 位输出请用 printf("%lld")