| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 150161 | 张晓冉 | 打印杨辉三角 | C++ | Accepted | 2 MS | 272 KB | 664 | 2026-03-22 17:39:49 |
#include<iostream> // cin\cout\endl #include<cstdio> //scanf()\printf() #include<cstring> // strcpy()\strcat()\strcmp()\strlen()\memset() #include<cmath> //sqrt()\pow()\abs()\ceil()\floor()\max()\min() using namespace std; int main(){ int n; cin >> n; int y[30][30] = {0}; for (int i = 0; i < n; ++i) { y[i][0] = 1; y[i][i] = 1; for (int j = 1; j < i; ++j) { y[i][j] = y[i - 1][j - 1] + y[i - 1][j]; } } for (int i = 0; i < n; ++i) { for (int j = 0; j <= i; ++j) { cout << y[i][j] << " "; } cout << endl; } return 0; }