杨辉三角（hdu2032）——有待完善

思考：杨辉三角形

#include<stdio.h>
#include<cstring>
int main()
{
    int  n;
    char d;
    int a[][] = {};
    while (scanf_s("%d%c",&n,&d)!=EOF)
    {
        a[][] = ;
        int i;
        for (i = ; i <= n; i++)
        {
            for (int j = ; j <= i; j++)
            {
                a[i][j] = a[i - ][j - ] + a[i - ][j];
                printf("%d", a[i][j]);
                if (j < i)
                    printf(" ");
            }
            printf("\n");
        }
        printf("\n");
    }
}