Submission

Score: 100

User: SushiCodelnw

Problemset: หินงอก

Language: c

Time: 0.001 second

Submitted On: 2025-09-25 12:24:00

#include <stdio.h>

int main() {
    int num;
    scanf("%d", &num);
    int n[num], max = 0;
    for (int i = 0; i < num; i++) {
        scanf("%d", &n[i]);
        if (n[i] > max) max = n[i];
    }

    for (int h = 0; h < max; h++) {
        for (int i = 0; i < num; i++) {
            if (n[i] >= h + 1) {
                if (n[i] == 1) printf("\\/");
                else {
                    for (int j = 0; j < h; j++) printf(" ");
                    printf("\\");
                    for (int j = 0; j < ((n[i]- 1) * 2) - (h * 2); j++) printf(" ");
                    printf("/");
                    for (int j = 0; j < h; j++) printf(" ");
                }
            }
            else for (int j = 0; j < n[i] * 2; j++) printf(" ");
        }
        printf("\n");
    }

    return 0;
}