题解 | 杨辉三角

#include <stdio.h>

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

    int shuzu[n][n];
    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            shuzu[i][j] = 0;
        }
    }

    shuzu[0][0] = 1;
    for (int i = 0; i < n; i++){
        for (int j = 0; j <= i; j++){
            if (i == 0 && j == 0){
                printf("%d\n", shuzu[i][j]);
                continue;
            }
            if (j == 0){
                shuzu[i][j] = shuzu[i - 1][j];
                printf("%d", shuzu[i][j]);
                if (j < i){
                    printf(" ");
                }
                if (j == i){
                    printf("\n");
                }
            }
            else {
                shuzu[i][j] = shuzu[i - 1][j] + shuzu[i - 1][j - 1];
                printf("%d", shuzu[i][j]);
                if (j < i){
                    printf(" ");
                }
                if (j == i){
                    printf("\n");
                }
            }
        }
    }

    return 0;
}