题解 | 圣诞树

#include <stdio.h>
void fun_0() {
    printf("* * * ");
}
void fun_1() {
    printf("*     ");
}
void fun_2() {
    printf("* *   ");
}



int main() {
    int a;
    int line;

    while ((scanf("%d", &a)) != EOF) {
        /* code */
        line = 4 * a;
        for (int i = 1; i <= line - a; i++) { //树line
            for (int j = 0; j < line - a - i ; j++) { //space
                /* code */
                printf(" ");
            }
            int count = i / 3 + 1;
            if (i % 3 == 0) {
                /* code */
                count--;

            }

            for (int k = 1; k <= count; k++) {

                /* code */
                switch (i % 3) {
                    case 0:/* code */
                        fun_0();
                        break;
                    case 1:/* code */
                        fun_1();
                        break;
                    case 2:/* code */
                        fun_2();
                        break;
                    default:
                        break;
                }
            }
            printf("\n");

        }
        for (int i = 1; i <= a; i++) {  //树根
            /* code */
            for (int j = 0; j < line - a - 1; j++) { //space
                /* code */
                printf(" ");
            }
            printf("* ");   //star
            printf("\n");
        }
    }





    return 0;
}