Submission

Score: 100

User: wasupum

Problemset: หินงอก

Language: c

Time: 0.002 second

Submitted On: 2025-10-06 02:59:51

#include <stdio.h>
#include <string.h>

int main(void){
    char cave[1000][1000];
    memset(cave,' ',sizeof(cave));
    int n,stone[20];
    scanf("%d",&n);
    int max = 0,ren = 0;
    for(int i = 0; i < n; i++){
        scanf("%d",&stone[i]);
        if(stone[i] > max) max = stone[i];
        ren += stone[i] * 2;
    }
    
    int next = 0;
    for(int i = 0; i < n ; i++){
        int j = 0;
        for(j = 0; j < stone[i] ; j++){
            cave[j][j+next] = '\\';
        }
        for(int k = stone[i] - 1; k >= 0; k--){
            cave[k][next + j++] = '/';
        }
        next += stone[i] * 2;
    }
    
    for(int i = 0 ; i < max; i++){
        for(int j = 0 ; j < ren ; j++){
            printf("%c",cave[i][j]);
        }
        printf("\n");
    }
    return 0;
}