蓝桥杯 基础练习 杨辉三角形

#include<iostream>

using namespace std;

int main()
{
	int a[34][34];
	int n;
	cin >> n;
	
	for (int i = 0; i < n; i++)
	{
		a[i][0] = 1;
		a[i][i] = 1;
		for (int j = 1; j < i; j++)
		{
			a[i][j] = a[i - 1][ j - 1] + a[i - 1][j];	
		}
	}	
	
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j <= i; j++)
		{
			cout << a[i][j];
			if (j < i)
				cout << " ";
		}
		cout<<endl;
	}
	return 0;
}