杨辉三角（金字塔型）

#include<stdio.h>
int main()
{
	int a[20][50];
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
	{
		a[i][1] = 1;//首尾置为1
		a[i][i] = 1;
	}

	for (int i =3; i <= n; i++)
	{
		for (int j =2; j <i; j++)
			a[i][j] = a[i - 1][j - 1] + a[i - 1][j];//根据规律
	}

	for (int i = 1; i <= n; i++)
	{
		for (int k = 0; k < (n - i) * 3; k++)//根据需要调整空格
			printf(" ");
		for (int j = 1; j <=i; j++)
			printf("%6d ", a[i][j]);
		
		printf("\n");
	}
}

6
                    1
                 1      1
              1      2      1
           1      3      3      1
        1      4      6      4      1
     1      5     10     10      5      1