Submission

Score: 100

User: winkawin2552

Problemset: หินงอก

Language: c

Time: 0.001 second

Submitted On: 2025-10-11 10:49:44

#include <stdio.h>

int main() {
    int n, max;
    scanf("%d", &n);
    int arr[n];
    for(int i =0; i<n;i++){
        scanf("%d", &arr[i]);
    }
    max = arr[0];
    for(int i = 1; i<n; i++){
        if(arr[i] > max) max = arr[i];

    }

    for(int i= 0; i<max; i++){
        for(int j =0;j< n;j++){    
            for(int k = 0; k < 2*arr[j]; k++){
                if(i < arr[j]){
                    if(i ==k) printf("\\");
                    else if((arr[j] *2 -(i+1)) == k) printf("/");
                    else printf(" ");
                }else printf(" ");
            }
        }printf("\n");

    }
    return 0;
}