题解 | #圣诞树#
圣诞树
https://www.nowcoder.com/practice/9a03096ed8ab449e9b10b0466de29eb2
#include<stdio.h> int main() { int input; scanf("%d", &input); int kong1 = -1 + input * 3; int kong2 = -1 + input * 3; for (int i = 1; i <= input; i++) { int midkong = 4; for (int j = 1; j <= 3; j++) { for (int k = 1; k <= kong1; k++) printf(" "); kong1--; for (int d = 1; d <= i; d++) { for (int a = 1; a <= j; a++) printf("* "); for (int e = midkong; e >= 1; e--) printf(" "); } midkong -= 2; printf("\n"); } } for (int b = 1; b <= input; b++) { for (int c = 1; c <= kong2; c++) printf(" "); printf("*\n"); } return 0; }