题解 | 杨辉三角

#include <stdio.h>

int main() {
    int n;
    scanf("%d",&n);

    int* a = calloc(sizeof(int), (n + 1));
    a[1] = 1;
    int pre;
    int up = 1;

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= i; j++){
            if(j == 1 || j == i){
                a[j] = 1;
                printf("%d ",1);
                continue;
            }
            pre = up;
            up = a[j];
            a[j] = pre + up;
            printf("%d ",a[j]);
        }
        printf("\n");
    }

}