杨辉三角－一维.c

各种算法

#include "stdio.h"
#include "math.h"
#define M 100
#define N 1
main()
{
    int i,t,n, a[M*M];
    scanf("%d", &n);
    for (i=1; i<=n; i++) 
    {
		a[i*1]=a[i*i]=N;
        for (t=2; t<i; t++)
			 a[i*t]=a[(i-1)*(t-1)]+a[(i-1)*t];
        printf("%3d",a[i*1]);
        for (t=2; t<=i; t++)
            printf(",%3d",a[i*t]);
        printf("\n");
    }
}