题解 | #杨辉三角#

#include <stdio.h>

int main() {
    int n = 0;
    scanf("%d", &n);
    int arr[n][n];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= i; j++) {
            if (j == 0 || j == i) {

                arr[i][j] = 1;

            } else {

                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("%5d",arr[i][j]);


}
printf("\n");
    }
    return 0;
}