题解 | 杨辉三角

#include <stdio.h>

int main()
{
    int n = 0;
    while (scanf("%d", &n) == 1)
    {
        int i = 0;
        int j = 0;
        int arr[30][30];
        for (i = 0; i < n; i++)
        {
            for (j = 0; j <= i; j++)
            {
                if (j == 0)
                    arr[i][j] = 1;
                else if (j == i)
                    arr[i][j] = 1;
                else
                    arr[i][j] = arr[i - 1][j] + arr[i - 1][j - 1];
                printf("%5d", arr[i][j]);
            }
            printf("\n");
        }
    }
    return 0;
}