P5732 【深基5.习7】杨辉三角

#include <iostream>
using namespace std;
int main() {
	int a[20][20];
	int x;
	cin >> x;
	a[0][0] = 1; a[1][1] = 1; a[1][0] = 1;
	for (int i = 2; i < x; i++) {
		for (int j = 1; j < i; j++) {
			a[i][j] = a[i - 1][j-1]+a[i-1][j];
		}
		a[i][i] = 1;
		a[i][0] = 1;
	}
	for (int i = 0; i < x; i++) {
		for (int j = 0; j<=i; j++) {
			cout << a[i][j]<<" ";
		}
		cout << endl;
	}
	return 0;
}