扬辉三角-二维.cpp

各种算法

/*左对齐扬辉三角*/

 #include "stdio.h"
 #include "math.h"
  main()
   { int i,j,t=8,m=10,n,a[30][30];
     scanf("%d",&n);
     n++;
     for (i=1;i<n;i++)
        { a[i][i]=1;a[i][1]=1;
        }  
     for (i=3;i<n;i++)
        for (j=2;j<=i-1;j++)
            a[i][j]=a[i-1][j-1]+a[i-1][j];
     for (i=1;i<n;i++)
         {for(j=1;j<=i;j++)
           {  
             if (i==j) printf("%d\n",a[i][j]);
             else 
             printf("%d,",a[i][j]);}
        } 
    }