杨辉三角形第8行

(a+b)7... ...1 7 21 35 35 21 7 1

//1 7 21 35 35 21 7 1
//以下为C语言源代码
#include<stdio.h>
void main()
{
int n; //Rows of the Yanghui Triangle
printf("Input the n : ");
scanf("%d",&n);
printf("The Yanghui Triangle as shown:\n");
void yanghui(int); //Declare for the function of yanghui
yanghui(n);
}

//Make up the Yanghui Triangle
void yanghui(int n)
{
int i,j;
int a[10][23]={0}; //Frame of triangle
a[0][(2*n+3)/2-1]=1; //Endow row1 with initial value
a[0][(2*n+3)/2+1]=1;
//Cipher out
for(i=1;i<n;i++)
for(j=1;j<n*2+2;j++)
a[i][j]=a[i-1][j-1]+a[i-1][j+1];
//Print out the triangle
for(i=0;i<n;i++)
{
for(j=0;j<n*2+3;j++)
{
if(a[i][j]!=0)
printf("%d",a[i][j]);
else
printf(" ");
}
printf("\n");