Submission

Status:

PPPPP

Subtask/Task Score:

100/100

Score: 100

User: gay69

Problemset: หินงอก

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-11 21:10:44

#include <stdio.h>

int main(){
    int q;
    scanf("%d", &q);
    int arr[q], most = 0;
    for (int i = 0; i < q; i++) {
        scanf("%d", &arr[i]);
        if (arr[i] > most) {
            most = arr[i];
        }
    }
    for (int i = 0; i < most; i++) {
        for (int k = 0; k < q; k++) {
            int n = arr[k];
            if (i >= n) {
                for (int j = 0; j < 2 * n; j++) {
                    printf(" ");
                }
                continue;
            }
            for (int j = 0; j < i; j++) {
                printf(" ");
            }
            printf("\\");
            for (int j = 0; j < 2 * (n - i - 1); j++) {
                printf(" ");
            }
            printf("/");
            for (int j = 0; j < i; j++) {
                printf(" ");
            }
        }
        printf("\n");
    }
    return 0;
}