用指针数组和一维整形数组存储n行杨辉三角

#include <iostream>
using namespace std;
int main()
{
int n,j;
int ia[10000];
int *p = &ia[3];
cout << "Enter a number : " << endl;
cin >> n;
ia[0] = 0;
ia[1] = 1;
ia[2] = 0;
for(int i = 2; i <= n ; ++i)
{
for(int j = 1; j < i + 2; ++j, ++p)
{
if(j == i+1)
*p = 0;
else
*p = *(p-i) + *(p-i-1);
}
}
for(int *q = ia; q <= p ; ++q)
{
if(*q == 0)
{
cout << endl;
++q;
}
cout << *q << " ";
}
return 0;
}