题解 | 杨辉三角

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
      vector<vector<int>> a(n+1,vector<int>(n+1,0));
    a[0][0]=1;
      for(int k=1;k<n+1;k++){for(int i=1;i<=k;i++){
        a[k][i]=a[k-1][i]+a[k-1][i-1];
        cout<<a[k][i]<<" ";
      }
      cout<<endl;
      }
      return 0;
}