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

