HDU ACM 11 2032 杨辉三角

#include <iostream>
using namespace std;
int main()
{
	int n, j =0;
	int Lu[100][100];
	while (cin >> n)
	{
		for (int i = 1; i < n; i++)
		{
			Lu[i][0] = 1;
			Lu[i][i] = 1;
		}
		Lu[0][0] = Lu[1][1] = 1;
		if (n > 2)
		{
			cout << Lu[0][0] << endl;
			cout << Lu[1][0] << ' ' << Lu[1][1] << endl;
		}
		if (n == 1)
			cout << 1 << endl;
		if (n == 2)
		{
			cout << Lu[0][0] << endl;
			cout << Lu[1][0] << ' ' << Lu[1][1] << endl;
		}
		for (int i = 2; i < n; i++)
		{
			cout << Lu[i][0];
			for (j = 1; j < i; j++)
			{
				Lu[i][j] = Lu[i - 1][j - 1] + Lu[i - 1][j];
				cout << ' ' << Lu[i][j];
			}
			cout << ' ' << Lu[i][i];
			cout << endl;
			j = 0;
		}
		cout << endl;
	}
	return 0;
}