题解 | 杨辉三角

#include<iostream>
#include<vector>
using namespace std;

int main() {
    int n;
    cin >> n;

    vector<long long> row(n, 1);

    for (int i = 0; i < n; i++) {
        // 从后往前更新，避免覆盖
        for (int j = i - 1; j > 0; j--) {
            row[j] = row[j] + row[j - 1];
        }

        // 输出当前行
        for (int j = 0; j <= i; j++) {
            cout << row[j] << " ";
        }
        cout << endl;
    }

    return 0;
}