Submission

PPPPP

Score: 100

User: Spongebob

Problemset: หินงอก

Language: c

Time: 0.001 second

Submitted On: 2024-10-16 23:40:23

#include <stdio.h>

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