hdoj 2032 杨辉三角 c++

#include<iostream>
using namespace std;

int main()
{
int a[30][30];
int n;
for (int i = 0; i < 30; i++)
{
a[i][0]=1;
a[i][i]=1;
for (int j = 1; j < i; j++)
{
a[i][j]=a[i-1][j]+a[i-1][j-1];
}
}
while (cin>>n)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j <i; j++)
{
cout<<a[i][j]<<" ";
}
cout<<a[i][i]<<endl;
}
cout<<endl;
}
return 0;
}