杨辉三角

#include<iostream>
void main()
{
	int arr[50];
	int num;
	std::cin >> num;
	for (int i = 1; i <= num;++i)
	{
		arr[1] = arr[i] = 1;
		for (int j = i - 1; j > 1;--j)
		{
			arr[j] = arr[j] + arr[j - 1];
		}
		for (int k = 1; k <= i; ++k)
		{
			std::cout << arr[k] << "   ";
		}
		std::cout << "\n";
	}
	system("pause");
}