杨辉三角

 

#include<stdio.h>
#include<string.h>
int main()
{
	int n,a[35][35],i,j,k,t,m,l;
	while(scanf("%d",&n)&&(n!=-1))
	{
		if(n<=0||n>=35)
			continue;
		else
		{
			memset(a,0,sizeof(a));
			for(i=1;i<=n;i++)
			{
				for(j=1;j<=i;j++)
				{
					if(i==1)
						a[i][j]=1;
					else
						a[i][j]=(a[i-1][j-1]+a[i-1][j]);
				}
			}
			m=1;
			t=n;
		    for(i=1;i<=n;i++)
			{
				j=1;
				for(l=1;l<=t;l++)
				   printf(" ");
			    for(k=1;k<=m;k++)
				{
				   if(k%2==0)
					  printf(" ");
				   else
					  printf("%d",a[i][j++]);
				}
			    printf("\n");
			    m+=2;
				t--;
			}
		}
		printf("\n");
	}
	return 0;
}