题解 | 杨辉三角

#include <stdio.h>

int main() {
    int n;
    scanf("%d", &n);
    // int sum = 0;
    int arr[36][36] = {0};
    arr[0][0] = 1;
    for (int i = 1; i < n; i++) {
        arr[i][0] = 1;
    }
    for (int i = 1; i < n; i++) {
        arr[i][i] =1;
    }
    for (int i=2;i<n;i++){
        for (int j=1;j<i;j++){
            arr[i][j] = arr[i-1][j] + arr[i-1][j-1];
        }
    }
    for (int i=0;i<n;i++){
        for (int j=0;j<=i;j++){
            printf("%d ",arr[i][j]);
        }
        printf("\n");
    }
    return 0;
}

暴力枚举，使用递推，计算每一个。然后输出；