BASIC-6杨辉三角形

Posted 2020-11-27 zeroone-world

• 杨辉三角 dp[i][j]=dp[i-1][j]+dp[i-1][j-1],初始化dp[1][1]=1;

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> P;
const int N=35;
const double PI=acos(-1);
#define line ‘
‘
#define gt getchar()
#define mid ((L+R)>>1)
int read(){int x=0,op=1;char c=gt;while(!isdigit(c)){if(c==‘-‘)op=-1;c=gt;}while(isdigit(c))x=x*10+c-48,c=gt;return x*op;}
int dp[N][N];
int main()
{
	int n=read();dp[1][1]=1;
	for(int i=2;i<=n;++i)for(int j=1;j<=i;++j)dp[i][j]=dp[i-1][j]+dp[i-1][j-1];
	for(int i=1;i<=n;++i){
		for(int j=1;j<i;++j)cout<<dp[i][j]<<" ";
		cout<<dp[i][i]<<line;
	}
	return 0;
}