题解 | 杨辉三角

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

int main() {
    int n;
    cin >> n;
    int s[n][n];

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if(j==0||i==j){
                s[i][j]=1;
            }else if(j!=0&&i!=j&&i>j)
            {
                s[i][j] = s[i-1][j]+s[i-1][j-1];
            }
            else {
                s[i][j]=0;
            }
            if(s[i][j]!=0){
                cout << s[i][j] << " ";
            }
        }
        cout << endl;
    }
}