- 博客(2)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 倒杨辉三角
#include int main() { int i, j, k, n; int a[100][100]; while (scanf("%d", &n) != EOF) { for (i = 0; i { a[i][i] = 1; a[i][0] = 1; } for (i = 2; i for (j = 1; j a[i][j] = a[i - 1][j] +
2017-12-15 22:34:54
165
原创 倒杨辉三角
#include int main() { int i, j, k, n; int a[100][100]; while (scanf("%d", &n) != EOF) { for (i = 0; i { a[i][i] = 1; a[i][0] = 1; } for (i = 2; i for (j = 1; j a[i][j] = a[i - 1][j] +
2017-12-15 22:26:38
1164
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人