杨辉三角问题

#include<stdio.h>
#include <windows.h>
#define N 10
int main()
{
    int a[N][N] = { 0 };
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        {
            if (i==j||j==0)
            {
                a[i][j] = 1;
            }
            else {
                a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
            }
        }
    }

    for (int i = 0; i < N;i++)
    {
        for (int j = 0; j <= i; j++)
        {
            printf("%4d", a[i][j]);

        }
        printf("
");
    }

    for (int i = 0; i < N; i++)
    {
        printf("%*d", 30 -2* i, a[i][0]);
        for (int j = 1; j <= i; j++)
        {
            printf("%4d", a[i][j]);

        }
        printf("
");
    }


    system("pause");
}