题解 | #杨辉三角#

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

    }
    return 0;
}