杨辉三角

#include<stdio.h>
#include<stdlib.h>

#define N 10

void main()
{
int a[N][N] = { 0 };//初始化二维数组a，所有元素
for (int i = 0; i < 10; i++)
{

for (int j = 0; j <= i; j++)
{
if(j==0||i==j)
{
a[i][j] = 1;
}
else
{
a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
}
}
}
for (int i = 0; i < 10; i++)
{
printf("%*d", 30 - i*2, a[i][0]);
for (int j = 1; j <= i; j++)
{
printf("%4d", a[i][j]);
}
printf("\n");
}
getchar();

}