HDU 2032 杨辉三角

#include <stdio.h>
#include <stdlib.h>
int ch[36][36];
void chart (  )
{
     int i,j;
     for ( i = 1; i <= 35; ++i )
     {
         ch[i][1] = 1;//对于每行的第一个比较特殊
         for ( j = 2; j < i; ++j )
         {
             ch[i][j] = ch[ i - 1 ][ j - 1 ] + ch[ i -1 ][ j ];
         }
         ch[i][j] = 1;//最后一个也要特殊处理
     }
 }
void print ( int n )
{
     for ( int i = 1 ; i <= n ; ++i )
     {
         for ( int j = 1 ; j <= i ; ++j )
             j == 1 ? printf ( "%d" , ch[ i ][ j ] ) :printf ( " %d" , ch[ i ][ j ] );
         puts ( "" );
     }

　　puts ( "" );
 }
int main ( )
{
    chart (  );
    int n;
    while ( scanf ( "%d",&n ) ==1 )
          print ( n );
    return 0;
}

 此题为一经典题目