//巴斯卡三角。返回第n行,n个
int nCr(int n,int r)
{
int p=1;
for (int i = 0;i<r;i++)
{
p *= (n-i);
}
for (r;r>1;r--)
{
p /= r;
}
return p;
};
//输出前n行
void yanhui(int n)
{
for (int i = 0;i<n;i++)
{
for (int j = 1;j<n-i;j++)
{
cout<<" ";
}
for (int j = 0;j<=i;j++)
{
printf("%3d",nCr(i,j));
}
cout<<endl;
}
};
int main()
{
yanhui(5);
return 0;
}