题解

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n ,lst[31][31] = {1};
    cin >> n;
    for (int i = 1 ; i <= n ; i++){
        for (inlinet j = 1 ; j <= i ; j++){
            lst[i][j] = lst[i - 1][j - 1] + lst[i - 1][j];//求此位置的值，为上一行上一列的数和其前一个数的和
            cout << lst[i][j] << " ";
        }
        cout << "\n";
    }
    return 0;
}