Submission

Score: 100

User: mrblbb

Problemset: หินงอก

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-10 22:32:30

#include <stdio.h>

int main(){
    int n;
    scanf("%d", &n);
    int arr[n];
    for (int i=0; i<n; i++){
        scanf("%d", &arr[i]);
    }
    int max_i=0;
    for (int i=0;i<n; i++){
        if (arr[i] > arr[max_i]){
            max_i=i;
        }
    }
    for (int i=0; i<arr[max_i]; i++){ //บรรทัด
        for (int j=0; j<n; j++){ //จำนวนภูเขา
            if (arr[j]<=i){
                for (int k=1; k<=arr[j]*2; k++){
                    printf(" ");
                }
            } else{
                for (int k=1; k<=arr[j]*2; k++){
                    if (k==i+1){
                        printf("\\");
                    } else if (k==arr[j]*2-i){
                        printf("/");
                    } else {
                        printf(" ");
                    }
                }
            }
        }
        printf("\n");
    }
}