杨辉三角形

/*杨辉三角*/#include <stdio.h>#define N 12int main(){int i,j,a[N][N];for( i = 1;i < N;i++){a[i][i] = 1;a[i][1] = 1;}for( i = 3 ;i < N ;i++ ){for( j = 2; j < i ;j++ ){a[i][j] = a[i-1][j-1]+a[i-1][j];}}for( i = 1;i < N ;i++ ){for( j = 1; j < i ;j++ ){printf("%5d",a[i][j]);}printf("\n");}return 0;}

/**************************************** *  File Name  : problem.c *  Creat Data : 2015.1.23*  Author     : ZY *****************************************/ /*最简单的问题与算法*//*杨辉三角形c(x,y) = 1                  , x = 1或 x = N+1         c(x-1,y-1)+c(x-1,y), 其他*/#include <stdio.h>#define N 12int c(int x,int y){if((y == 1)||(y == x+1))return 1;else return c(x-1,y-1)+c(x-1,y);}int main(){int i,j;for( i = 0 ;i <= N ;i++ ){for( j = 0 ;j < N-i ;j++ ){printf("  ");}for( j = 1 ; j < i+2;j++ ){printf("%5d",c(i,j));}printf("\n");}return 0;}