Tsinsen 清橙 A1015. 杨辉三角形 (循环)

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