else return getelem(n-1,k-1)+getelem(n-1,k);
}//getelem
void output(long n)
{//输出杨辉三角,n为杨辉三角的阶数
int row,col;
for(row=0;row<=n;row++)
{
for(col=0;col<=row;col++)
printf(" %5ld",getelem(row,col));
printf("\n");
}//for
}//output
else return getelem(n-1,k-1)+getelem(n-1,k);
}//getelem
void output(long n)
{//输出杨辉三角,n为杨辉三角的阶数
int row,col;
for(row=0;row<=n;row++)
{
for(col=0;col<=row;col++)
printf(" %5ld",getelem(row,col));
printf("\n");
}//for
}//output