c++练习题——杨辉三角

设计函数计算n(1<=n<=25)行的杨辉三角，存放在二维数组中，再输出。

#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
    int n;
    cin >> n;
    n = n;
    int m = 2 * n - 1;

    int** arr = new int * [m];
    for (int i = 0; i < m; ++i)
    {
        arr[i] = new int[n];
    }
    arr[n + 1][m] = { 0 };
    for (int i = 0; i < n; i++)
    {
        arr[i][n - i - 1] = 1;
        arr[i][n + i - 1] = 1;

    }
    for (int i = 2; i < n; i++)
    {
        for (int j = n - i + 1; j < n - 2 + i; j = j + 2)
            arr[i][j] = arr[i - 1][j - 1] + arr[i - 1][j + 1];
    }
    int p;
    for (int i = 0; i < n; i++)
    {
       

        p = 1;
        for (int j = n - i - 1; p < i + 2; j = j + 2)
        {
            cout << arr[i][j]<<" ";

            p = p + 1;
        }
        cout << endl;
    }
    return 0;
}