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