OJ刷题记录：杨辉三角形

#include <bits/stdc++.h>

using namespace std;

int main() {
	int n;
	
	cin >> n;
	
	int row = n + 1;
	int column = n + 1;
	
	int mat[row][column];
	
	for (int i = 0; i < row; i++) {
		for (int j = 0; j < column; j++) {
			mat[i][j] = 0;
		}
	}
	mat[1][1] = 1;
	
	for (int i = 1; i < row; i++) {
		for (int j = 1; j < column; j++) {
			if (i == 1 && j == 1) continue;
			
			mat[i][j] = mat[i - 1][j] + mat[i - 1][j - 1];
		}
	}
	
	for (int i = 1; i < row; i++) {
		for (int j = 1; j < column; j++) {
			if (mat[i][j] == 0) continue;
			
			cout << mat[i][j] << ' ';
		}
		cout << endl;
	}
 	
	return 0;
}