洛谷P5732 【深基5.习7】杨辉三角经典解法

#include<stdio.h>
int a[21][21];
int main(void)
{
	int i, n, j;
	scanf("%d", &n);
	for (i = 1; i <= n; i++)
	{
		a[i][1] = a[i][i] = 1;
	}
	for (i = 1; i <= n; i++)
	{
		for (j = 2; j < i;j++)
		{
			a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
		}
	}
	for (i = 1; i <= n; i++)
	{
		for (j = 1; j <= i;j++)
		{
			printf("%d ", a[i][j]);
		}
		printf("\n");
	}
	return(0);
}