Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
85496 | 小徐老师 | 打印杨辉三角 | Python3 | Accepted | 39 MS | 3844 KB | 295 | 2024-07-17 18:55:30 |
n = int(input()) f = [[0 for _ in range(n + 1)]for _ in range(n + 1)] for i in range(n): f[i][0] = f[i][i] = 1 for i in range(0, n): for j in range(i + 1): if f[i][j] == 0: f[i][j] = f[i - 1][j] + f[i - 1][j - 1] print(f[i][j], end = " ") print()