#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int main()
{
int n;
int s[32][32];
while(cin>>n)
{
s[1][1]=1; s[2][1]=1; s[2][2]=1;
cout<<"1"<<endl;
s[1][2]=0;
for(int i=2;i<=n;i++)
{
s[i][1]=1;
cout<<"1"<<" ";
for(int j=2;j<=i-1;j++)
{
s[i][j]=s[i-1][j-1]+s[i-1][j];
cout<<s[i][j]<<" ";
}
s[i][i]=1;
cout<<"1"<<endl;
}
cout<<endl;
}
return 0;
}
HDU2032杨辉三角
最新推荐文章于 2020-10-28 22:26:01 发布