题解 | 杨辉三角

#include <stdio.h>

int main() {
    int a,b,n;
    scanf("%d",&n);
    unsigned long int shu[n][n];
    shu[0][0]=1;
    for(a=0;a<n;a++)
    {
        for(b=0;b<n;b++)
        {
            if(b==0)
            {
                shu[a][b]=1;
            }
            else shu[a][b]=0;
        }
    }
    for(a=0;a<n;a++)
    {
        for(b=0;b<=a;b++)
        {
            if(b==0) printf("%ld ",shu[a][b]);
            else 
            {
               shu[a][b]=shu[a-1][b-1]+shu[a-1][b]; 
               printf("%ld ",shu[a][b]);
            }
        }
        printf("\n");
    }

    return 0;
}