用C++实现杨辉三角的输出

#include "stdafx.h" #include <iostream> using namespace std; int main() { //著名的杨辉三角就此破解 static int d[6][7]; d[0][1] = 1; for (int i = 1; i < 6; i++) { for (int j = 1; j < i+2; j++) { d[i][j] = d[i - 1][j - 1] + d[i - 1][j]; } } for (int i = 0; i < 6; i++) { for (int j = 1; j < i + 2; j++) { cout << d[i][j]<<" "; } cout << endl; } system("pause"); return 0; }