基础练习 杨辉三角形

//  基础练习 杨辉三角形
#include <stdio.h>
int main()
{
	int i = 0, j = 0, n = 0;
	int TriAngle[34][34] = {0};

	scanf("%d",&n);
	for (i = 0; i < n; ++i)//将第一列和对角线初始化为1
	{
		TriAngle[i][0] = 1;
		TriAngle[i][i] = 1;
	}
	for (i = 2; i < n; ++i)//i=0,1,2 从第3行开始...
	{
		for (j = 1; j < i; ++j)
		{
			TriAngle[i][j] = (TriAngle[i-1][j-1]+TriAngle[i-1][j]);
		}
	}
	for (i = 0; i < n; ++i)//打印杨辉三角
	{
		for (j = 0; j <= i; ++j)
		{
			printf("%d ",TriAngle[i][j]);
		}
		printf("\n");
	}
	return 0;
}