Submission

PPPPP

Score: 100

User: Spongebob

Problemset: หินงอก

Language: c

Time: 0.002 second

Submitted On: 2024-10-05 19:33:32

#include <stdio.h>

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