生成杨辉三角形算法

生成杨辉三角形算法

#include <stdio.h>

#define MAXN    12

int main()
{
    int arr[2][1+MAXN], n, i, j;
    
    while (scanf("%d", &n) != EOF)
    {
        for (i=0; i<=MAXN; i++)
            arr[0][i] = arr[1][i] = 0;
        arr[0][1] = 1;
        for (i=1; i<=n; i++)
        {
            for (j=1; j<=i; j++)
                arr[i%2][j] = arr[(i-1)%2][j-1]+arr[(i-1)%2][j];
            for (j=1; j<=i; j++)
                printf("%-4d", arr[i%2][j]);
            printf("/n");
          }
          printf("/n");
     }
    
    return 0;
}