程序代码：

#include <stdio.h>
#define MAXN 100
int a[MAXN] = {1,1,1,0} ;
int main()
{
    int i , j ;
    printf("1\n" ) ;
    printf("1 1\n") ;
    for( i = 2 ; i < 10 ; ++i )
    {
        a[ i * ( i - 1 ) / 2 ] = 1 ;
        printf("%d " , a[ i * ( i - 1 ) / 2 ] ) ;
        for( j = 1 ; j <= i ; ++j )
        {
            a[ i * ( i + 1 ) / 2 + j ] = a[ ( i - 1 ) * ( i ) / 2 + j ]  +  a[ ( i - 1 ) * ( i ) / 2 + j - 1 ] ;
            printf("%d " , a[ i * ( i + 1 ) / 2 + j ] ) ;
        }
        printf("\n") ;
    }
    return 0 ;
}

#include <stdio.h>
#include <math.h>
#define MAXN 110
int a[MAXN] = {0} ;
int main()
{
    int i , j ;
    int m = (int)sqrt(MAXN) ;
    for( i = 1 ; i <= m ; ++i )
    {
        a[i * m] = 1 ;
        printf("%d ", a[i * m] ) ;
        for( j = 1 ; j < i ; ++j )
        {
            a[i * m + j] = a[( i - 1 ) * m + j - 1] + a[( i - 1 ) * m + j] ;
            printf("%d ", a[i * m + j] ) ;
        }
        printf("\n") ;
    }
    return 0 ;
}

#include <stdio.h>
int Print( int m , int n )
{
    if( m == 0 || n == 0 )
        return 1 ;
    int a = 1 , b = 1 ;
    int i ;
    for( i = 1 ; i <= n ; ++i )
    {
        b *= i ;
    }
    for( i = m - n + 1 ; i <= m ; ++i )
    {
        a *= i ;
    }
    return a / b ;
}
int main()
{
    int i , j ;
    for( i = 0 ; i < 10 ; ++i )
    {
        for( j = 0 ; j <= i ; ++j )
        {
            printf("%d ", Print( i , j ) ) ;
        }
        printf("\n") ;
    }
    return 0 ;
} 

#include <stdio.h>
int main()
{
    int a[2][10] = { 0 } ;
    a[0][0] = a[1][0] = a[0][1] = 1 ;
    int i , j ;
    printf("1\n") ;
    printf("1 1\n") ;
    for( i = 2 ; i < 10 ; ++i )
    {
        a[1][0] = a[0][0] = 1 ;
        printf("%d ", a[1][0] ) ;
        for( j = 1 ; j <= i ; ++j )
        {
            a[1][j] = a[0][j] + a[0][j - 1] ;
            printf("%d " , a[1][j] ) ;
        }
        printf("\n") ;
        for( j = 1 ; j <= i ; ++j )
        {
            a[0][j] = a[1][j] ;
        }
    }
    return 0 ;
}

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

i=1,j,f[99]={0,1};main(n){for(scanf("%d",&n);i++<=n;puts(""))for(j=i;--j;printf("%d ",f[j]+=f[j-1]));}