hdu 2032 杨辉三角

 1 #include <stdio.h>
 2 int main ()
 3 {
 4     int n,i,j,a[30][30];
 5     while (scanf("%d",&n)!=EOF)
 6     {
 7         for (i=0; i<n; i++)
 8             a[i][0]=a[i][i]=1;
 9         for (i=2; i<n; i++)
10         {
11             for (j=1; j<i; j++)
12             {
13                 a[i][j]=a[i-1][j]+a[i-1][j-1];
14             }
15         }
16         for (i=0; i<n; i++)
17         {
18             for (j=0; j<=i; j++)
19             {
20                 if(i==j)
21                     printf ("%d",a[i][j]);
22                 else printf("%d ",a[i][j]);
23             }
24             printf ("\n");
25         }
26         printf ("\n");
27     }
28 }