杨辉三角形 http://lx.lanqiao.cn/problem.page?gpid=T10
1 #include<iostream> 2 using namespace std; 3 int main() 4 { 5 int x[34][34] = { 0 }; 6 for (int i = 0; i < 34; i++) 7 x[i][0] = 1; 8 for (int i = 1; i < 34; i++) 9 for (int j = 1; j <= i; j++) 10 x[i][j] = x[i - 1][j - 1] + x[i - 1][j]; 11 int n; cin >> n; 12 for (int i = 0; i < n; i++) 13 { 14 for (int j = 0; j < i + 1; j++) 15 cout << x[i][j] << ' '; 16 cout << endl; 17 } 18 return 0; 19 }