<hdu-2032>杨辉三角

 1 #include <iostream>
 2 #include <cstring>
 3 #include <algorithm>
 4 #define N 32
 5 
 6 using namespace std;
 7 
 8 int a[N][N];
 9 int n;
10 void creat() {
11     for(int i = 0;i <= n; ++i) {
12         a[i][i] = 1;
13         a[i][0] = 1;
14     }
15     for(int i = 2;i <= n; ++i) {
16         for(int j = 1;j < i; ++j) {
17             a[i][j] = a[i-1][j] + a[i-1][j-1];
18         }
19     }
20 }
21 void print_ () {
22     int i,j;
23     for(i = 0;i < n; ++i) {
24         for(j = 0;j < i; ++j) {
25             cout << a[i][j] << " ";
26         }
27         cout << a[i][j];/////根据题意--每个整数之间用空格隔开，（注意：最后一个整数后面不能有空格）在这里单独输出最后一个整数1即可
28         cout << endl;
29     }
30     cout << endl;
31 }
32 int main() {
33     memset(a,0,sizeof(a));
34     while (cin >> n) {
35         creat();
36         print_();
37     }
38     return 0;
39 }