题解 | #杨辉三角#

#include<stdio.h> int main() { int arr[30][30] = { 0 }; int n, r, c; scanf("%d", &n); for (r = 0; r < n; r++) { for (c = 0; c <= r; c++) { if (c == 0 || c == r) arr[r][c] = 1; else arr[r][c] = arr[r - 1][c - 1] + arr[r - 1][c]; printf("%5d", arr[r][c]); } printf("\n"); } return 0; }