杨辉三角的实现

//杨辉三角
void Ytrangle()
{
#define N 10
	int a[N][N] = { 1 ,0};
	for (int i = 0; i < N; 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] + a[i - 1][j - 1];
			}
		}
	}
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j <= i; j++)
		{
			printf("%d  ", a[i][j]);
		}
		printf("\n");
	}
}
int main()
{
	Ytrangle();
}