杨辉三角
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 24675 Accepted Submission(s): 10289
#include<stdio.h>
int main()
{
int n,k,l,a[2][100],i,j,flog=0;
while(scanf("%d",&n)!=EOF)
{
if(n==1)printf("1\n");
else
printf("1\n1 1\n");
a[0][0]=1;a[0][1]=1;k=1;l=0;
for(i=3;i<=n;i++)
{
for(j=0;j<i;j++)
{
if(j==0||j==i-1)a[k][j]=1;
else a[k][j]=a[l][j-1]+a[l][j];
printf("%d",a[k][j]);
if(j!=i-1)printf(" ");
}
printf("\n");k+=l;l=k-l;k-=l;******(交换k,l值)
}
printf("\n");
}
}