【算法笔记】 codeup 习题6-6 杨辉三角

#include 

int main()
{
    int n;
    scanf("%d", &n);
    int a[n][n];
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j <= i; j++)
        {
            if (j == 0 || j == i)
            {
                a[i][j] = 1;
                printf("%d ", a[i][j]);
                continue;
            }
            a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
            printf("%d ", a[i][j]);
        }
        printf("n");
    }
    return 0;
}