蓝桥杯 杨辉三角形

方法一：

#include <iostream>#include <algorithm>using namespace std; int main(){  int n; cin>>n; int a[34][34]; for (int i=0;i<n;i++){  a[i][0]=1; a[i][i]=1;} for(int i=2;i<n;i++){for (int j=1;j<i;j++){ a[i][j]=a[i-1][j-1]+a[i-1][j]; }} for (int i=0;i<n;i++){for (int j=0;j<=i;j++){cout<<a[i][j]<<" ";}cout<<endl; }return 0; }

方法二：二维数组

#include <iostream>#include <algorithm>using namespace std; int main(){  int n; cin>>n; int a[2][34];     a[0][0]=a[1][0]=a[1][1]=1;          if (n==1) { cout<<1<<endl;  }else    {cout<<1<<endl;                                                                             cout<<1<<" "<<1<<endl;   for (int i=2;i<n;i++){  for (int j=1;j<i;j++){  a[0][j]=a[1][j];                                                                                       }   for (int j=1;j<i;j++){ a[1][j]=a[0][j]+a[0][j-1];                                                                                             }      a[1][i]=1;   for (int j=0;j<=i;j++)     {cout<<a[1][j]<<" ";                 }  cout<<endl; }    } return 0; }