题解 | #圣诞树#
圣诞树
https://www.nowcoder.com/practice/9a03096ed8ab449e9b10b0466de29eb2
#include <stdio.h> int main() { int a = 0; int b = 0; int c = 0; scanf("%d", &a); int d = a; int e = 0; int SB = 0; for (d = a; d > 0; d--) { b = 0; if (b < d) { printf(" "); printf(" "); } for (c = 1; c < d; c++) { printf(" "); printf(" "); printf(" "); } printf("*"); for (SB=d; a-SB>0; SB++) { printf(" *"); } printf("\n"); /////////////////////////////////////////// ///////////////////////////// b = 0; if (b < d) printf(" "); for (c = 1; c < d; c++) { printf(" "); printf(" "); printf(" "); } printf("* *"); for (SB = d; a - SB > 0; SB++) { printf(" * *"); } printf("\n"); ///////////////////////// for (c = 1; c < d; c++) { printf(" "); printf(" "); printf(" "); } printf("* * *"); for (SB = d; a - SB > 0; SB++) { printf(" * * *"); } printf("\n"); //第一层移动n次,第二层移动n-1次,第三层移动n-2次,第n层移动n-n=0次; } //////////////////////////////////////////// for (b = 0; b < a; b++) { printf(" "); printf(" "); for (c = 1; c < a; c++) { printf(" "); printf(" "); printf(" "); } printf("*"); printf("\n"); } }