杨辉三角(C语言等腰三角形排版)

#include<stdio.h>

int yanghuiSJ(int n)
{
	int spac=n;
    
	if (n > 1000 || n <= 0)
		return -1; 
		
    long arr[n][n];   

	arr[0][0] = 1;
	arr[1][0] = 1;
	arr[1][1] = 1;

    for (int i = 2; i < n; i++)
	{
		for (int j = 0; j <= i; j++)
		{
			if (j == 0 || j == i )
				arr[i][j] = 1L;
			else
				arr[i][j] = arr[i - 1][j] + arr[i - 1][j - 1];
		}
	}

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j <= i; j++)
		{
            if(j==0)
            {
                for(int k=0;k<spac-i;k++)
                {
                    printf("   ");
                }
            }
			printf("%6ld", arr[i][j]);
		}

		printf("\n\n");
	}

	return 0;
}

int main(int argc, char **argv)
{
	int n=8;
	printf("输入行数：");
	scanf("%d", &n);
	yanghuiSJ(n);

	return 0;
}