Submission

[PPPPPPPPP]

Score: 100

User: Cmoss9

Problemset: ภูเขา

Language: c

Time: 0.002 second

Submitted On: 2024-10-04 22:39:43

#include <stdio.h>
int main () {
    int numberofhill;
    int mountainheight[100];
    scanf("%d",&numberofhill);
    for (int i = 0;i<numberofhill;i++) {
        scanf("%d",&mountainheight[i]);
    }
    // max height
    int max = mountainheight[0];
    int size = numberofhill;
    for (int i =0;i<size;i++) {
        if (max<mountainheight[i]) {
            max = mountainheight[i];
        }
    }
    // finding max is true
     for (int row = 0; row < max; row++) {
        for (int i = 0; i < numberofhill; i++) {
            int height = mountainheight[i];
            // Print ascending part of hill
            if (row < max - height) {
                // Print dots above the hill to keep alignment
                for (int j = 0; j < height * 2; j++) {
                    printf(".");
                }
            } else {
                // Print the hill's ascending and descending parts
                int current_row = row - (max - height); // Adjust row for current hill's height
                for (int j = 0; j < height - current_row - 1; j++) {
                    printf(".");
                }
                printf("/");
                for (int j = 0; j < 2 * current_row; j++) {
                    printf(".");
                }
                printf("\\");
                for (int j = 0; j < height - current_row - 1; j++) {
                    printf(".");
                }
            }
        }
        printf("\n");
    }
    return 0;
}