C杨辉三角

# include <stdio.h>
# include <malloc.h>
# include <windows.h>

typedef struct dui
{
	int a[100];
	int front, rear;
}di, *pdi;

void sc(pdi dui)
{
	int i, j, tem;
	dui->a[dui->rear] = 1;
	dui->rear++;
	for (i = 0; i < 8; i++)
	{
		printf("  ");
	}
	printf("%2d\n", dui->a[dui->front]);
	for (i = 2; i < 10; i++)
	{
		for (j = 9; j > i; j--)
		{
			printf("  ");
		}
		printf("%2d  ", dui->a[dui->front]);
		for (j = 0; j < i - 2; j++)
		{
			tem = dui->a[dui->front];
			dui->front++;
			tem = tem + dui->a[dui->front];
			printf("%2d  ", tem);
			dui->a[dui->rear] = tem;
			dui->rear++;
		}
		dui->a[dui->rear] = 1;
		dui->rear++;
		printf("%2d\n", dui->a[dui->front]);
	}
	return;
}
int main(void)
{
	pdi dui = (pdi)malloc(sizeof(di));
	dui->front = 0;
	dui->rear = 0;
	sc(dui);
	system("pause");
	return 0;
}