Submission

[-SSSSSSSS]

Score: 0

User: Cmoss9

Problemset: ภูเขา

Language: c

Time: 0.001 second

Submitted On: 2024-10-04 22:37:57

#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<size;i++) {
            for (int j = 0;j<=mountainheight[i]-row;j++) {
                if (j == mountainheight[i]-row) {
                    printf("/");
                } else {
                    printf(".");
                }
            }
            for (int j = mountainheight[i]-row+1;j<=mountainheight[i];j++) {
                printf(".");
            }
            for (int j = mountainheight[i]+1;j<mountainheight[i]*2;j++) {
                if (j == mountainheight[i]+row+1) {
                    printf("\\");
                } else {
                    printf(".");
                }
            }
        }
    printf("\n");
    }
    
}