c++输出杨辉三角

#include<iostream>
using namespace std;

#define N 5


int arr[N][N];
void show();


int main(int argc, char *argv[])
{  
	for (size_t i = 0; i < N*N; i++)
	{
		arr[i / N][i % N] = 1;

	}
	show();
	system("pause");
	return 0;
}

void show()
{
	for (size_t i = 0; i < N; i++)
	{
		for (size_t k = 0; k < 4*(N-i);k++)
		{
			cout << " ";
		}
		
		
		for (size_t j = 0; j < N; j++)
		{
			if (i>=j)
			{
				if (i>=2&&j>=1)
				{
					arr[i][j] = arr[i - 1][j - 1] + arr[i - 1][j];
				}
				arr[j][j] = 1;
				cout <<"   "<<arr[i][j]<<"    ";
			}
			

		}
		cout << endl;

	}
}