HDU-2032-直角杨辉三角

#include<stdio.h>
int main()
{int a[50][50];
int n,i,j;
   
while(scanf("%d",&n)!=EOF)
   {
    for(i=1;i<=n;i++)
                       {
       for(j=1;j<=i;j++)
        {
        if(i==j||j==1)a[i][j]=1;
        else
        a[i][j]=a[i-1][j-1]+a[i-1][j];
        printf("%d",a[i][j]);
        if(j<i)printf(" ");
        }
        printf("\n");
                         }printf("\n");
      }
     // while(1);       
    return 0;   
}