C++ 打印帕斯卡三角程序

编写一个C++程序来打印帕斯卡三角，并提供一个示例。在此帕斯卡三角示例中，long factorialNum(int number) 函数用于计算数字的阶乘。在嵌套的 for 循环中，我们使用此方法来生成我们的模式。

#include<iostream>
using namespace std;

long factorialNum(int number)
{
	long factorial = 1;
	
	for (int i = 1; i <= number; i++)
	{
		factorial = factorial * i;
	}
	return factorial;
}

int main()
{
	int i, j, number;
	
	cout << "\nPlease Enter the Number  =  ";
	cin >> number;	
	cout << "\n----------\n ";
	for (i = 0; i < number; i++)
	{
		for (j = 0; j <= (number - i - 2); j++)
		{
			cout << " ";
		}
		for (j = 0; j <= i; j++)
		{
			cout << factorialNum(i) / (factorialNum(j) * factorialNum(i - j)) << " ";
		} 
		cout << "\n";
	}
 	return 0;
}

Please Enter the Number  =  7

----------
       1 
     1 1 
    1 2 1 
   1 3 3 1 
  1 4 6 4 1 
 1 5 10 10 5 1 
1 6 15 20 15 6 1 

我们正在使用递归概念来打印帕斯卡三角。请参考 C++ 程序。

#include<iostream>
using namespace std;

long factorialNum(int number)
{
	if(number == 0 || number == 1)
	{
		return 1;
	}
	else
	{
		return number * factorialNum(number - 1);
	}
}

int main()
{
	int i, j, number;
	
	cout << "\nPlease Enter the Number for Pascal Triangle  =  ";
	cin >> number;	
	cout << "\n-----Pascal Triangle-----\n ";
	for (i = 0; i < number; i++)
	{
		for (j = 0; j <= (number - i - 2); j++)
		{
			cout << " ";
		}
		for (j = 0; j <= i; j++)
		{
			cout << factorialNum(i) / (factorialNum(j) * factorialNum(i - j)) << " ";
		} 
		cout << "\n";
	}
 	return 0;
}