杨辉三角的多种解法（Multiple solutions of Yang Huis triangle）.doc

杨辉三角的多种解法（Multiple solutions of Yang Huis triangle） Multiple solutions of 7. Yang Huis triangle The form of the Yang Hui triangle is as follows: One 11 121 1331 146411615201561 172135352171 18285670562881 193684126126843691 ...... Rule: except the elements on both sides are 1, the value of each position in the other is equal to the sum of the elements on the two shoulders. This may be because the output of Pyramid like not too easy to program output, see some books are going direct is as follows: One 11 121 1331 146411615201561 172135352171 18285670562881 193684126126843691 Rule: in addition to both sides of the elements are 1, the rest of each position of the element value is the upper left corner elements and the sum of the above elements, so easy to use array. Two dimensional array: First of all, its easier to think of a two-dimensional array, and try to write one (just 10 lines). Ideas: first the elements on both sides of each line, start and end values are set to 1, then from the beginning of the third line (line one or two to 1), among other elements and two elements for the upper left corner and right above the elements and elements. #include stdio.h #define N / * * / 10 dimension Int main () { Int i; Int j; Int a[N][N]; two-dimensional array stored Yang Hui triangle / * definition For (I = 0; I N; i++) { A[0] = 1; / * * / 1 values for each line begins A = 1; / * the end of each line is 1. } For (I = 2; I N; i++) For (J = 1; J I; j++) A[j] = a[i-1][j-1] + a[i-1][j]; / * Law: on the left and on the sum of the elements. For (I = 0; I N; i++) { For (J = 0; J I; j++) Printf (%-5d, a[j]); Printf (\n); } Return 0; } Operation result (VC): =============================================================== One 11 121 1331 146411615201561 172135352171 18285670562881 193684126126843691 =============================================================== So how do you display the shape of Pyramid? The problem is how to space the number of each