杨辉三角

#include
#include
#include


#define LINE 9
#define ROW 17


void main()
{


int a[LINE][ROW] = { 0 };
a[0][ROW / 2] = 1;


for (int i = 0; i < LINE; i++)
{
for (int j = 0; j < ROW; j++)
{
if (i == 0)//打印第一行
{
if (a[i][j] == 0)
{
putchar(' ');
putchar(' ');
}
else
printf("%-2d", a[i][j]);
}


else if (j == 0)
{
a[i][j] = a[i - 1][j + 1];
if (a[i][j] == 0)
{
putchar(' ');
putchar(' ');
}
else
printf("%-2d", a[i][j]);
}


else if (j == (ROW - 1))
{
a[i][j] = a[i - 1][j - 1];
if (a[i][j] == 0)
{
putchar(' ');
putchar(' ');
}
else
printf("%-2d", a[i][j]);
}


else
{
a[i][j] = a[i - 1][j - 1] + a[i - 1][j + 1];
if (a[i][j] == 0)
{
putchar(' ');
putchar(' ');
}
else
printf("%-2d", a[i][j]);
}
}
printf("\n");
}


system("pause");
}