题解 | #圣诞树#
圣诞树
https://www.nowcoder.com/practice/9a03096ed8ab449e9b10b0466de29eb2
#include <stdio.h> int main() { //当n>=2时,圣诞树的树冒是由3*n-3个三角形组成的,树柄是由n个*在3*n-1列组成的 int n = 0; scanf("%d", &n); int d = 3 * n; for (int i = 1; i <= n; i++) { for (int a = d -1;a>0;a--) { printf(" "); } for (int k = 1; k <= i; k++) { printf("* "); printf("\n"); for (int a = d - 2; a > 0; a--) { printf(" "); } for (int k = 1; k <= i; k++) { printf("* * "); } printf("\n"); for (int a = d-3; a > 0; a--) { printf(" "); } for (int k = 1; k <= i; k++) { printf("* * * "); } printf("\n"); d = d - 3; } int c = 0; while (c<=n) { for (int i = 1; i <= 3 * n - 1 ; i++) { printf(" "); } printf("*\n"); c++; } return 0; }