Submission

[PPPPPPPPP]

Score: 100

User: Pera

Problemset: ภูเขา

Language: c

Time: 0.002 second

Submitted On: 2024-10-13 10:09:09

#include <stdio.h>

int main(void) {
    int n;
    scanf("%d", &n);
    int height[n];
    for (int i = 0; i < n; i++) {
        scanf("%d", &height[i]);
    }

    int max = 0;
    for (int i = 0; i < n; i++) {
        if (height[i] > max) {
            max = height[i];
        }
    }

    // Loop through every row
    for (int i = 0; i < max; i++) {
        // Loop through every mountain
        for (int j = 0; j < n; j++) {
            for (int k = 0; k < height[j]; k++) {
                if (max - k - 1 == i) printf("/");
                else printf(".");
            }
            for (int k = height[j]; k > 0; k--) {
                if (max - k == i) printf("\\");
                else printf(".");
            }
        }
        printf("\n");
    }
}