题解 | 杨辉三角

#include <stdio.h>

int main() {
    int n;
     
    scanf("%d", &n);
    long int a[n][n];
    a[0][0] = 1;
    printf("1\n");
    for (int i = 1; i < n; i++)
    {
        for (int j = 0; j <= i; j++)
        {
            int left, top;
            if (j == 0)
                left = 0;
            else
                left = a[i-1][j-1];
            if (i == j)
                top = 0;
            else
                top = a[i-1][j];
            a[i][j] = left + top;
            printf("%ld ", a[i][j]);
        }
        printf("\n");
    }
    
    
    return 0;
}