题解 | 杨辉三角

#include<bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> r(n, 0);
    r[0] = 1; 
    for (int i = 0; i < n; ++i) {
        for (int j = i; j > 0; --j) {
            r[j] = r[j] + r[j-1];
        }

        for (int j = 0; j <= i; ++j) {
            if (j > 0) cout << " ";
            cout << r[j];
        }
        cout << endl;
    }
    return 0;
}