Submission

Score: 0

User: MoZkun

Problemset: หินงอก

Language: cpp

Time: 0.000 second

Submitted On: 2025-10-01 11:07:54

#include<bits/stdc++.h>
using namespace std;

int main(){
    int n;
    cin >> N;

    int h[20];
    int maxH = 0;

    for(int i=0;i<N;i++){
        cin >> h[i];
        if(h[i]>maxH) maxH = h[i];
    }

    for(int level=maxH; level>=1; level--){
        for(int i=0;i<N;i++){
            if(h[i] >= level){
                cout << "\\";
            }else{
                cout << " ";
            }

            if(h[i] >= level){
                cout << "/";
            }else{
                cout << " ";
            }

            if(i<n-1) cout << " ";
        }
        cout << "\n";
    }

    return 0;
}