题解 | #圣诞树#
圣诞树
https://www.nowcoder.com/practice/9a03096ed8ab449e9b10b0466de29eb2
#include <stdio.h> int main() { int n = 0; scanf("%d", &n); int m = 2 + (n - 1) * 3; for (int j = 0; j < n; j++) { for (int i = 0; i < m - 3 * j; i++) printf(" "); for (int i = 0; i < j + 1; i++) printf("* "); printf("\n"); for (int i = 0; i < m - 1 - 3 * j; i++) printf(" "); for (int i = 0; i < j + 1; i++) printf("* * "); printf("\n"); for (int i = 0; i < m - 2 - 3 * j; i++) printf(" "); for (int i = 0; i < j + 1; i++) printf("* * * "); printf("\n"); if (j == n - 1) for (int i = 0; i < n; i++) { for (int x = 0; x < m; x++) printf(" "); printf("*\n"); } } return 0; }