Submission

Score: 100

User: mik

Problemset: หินงอก

Language: cpp

Time: 0.003 second

Submitted On: 2026-10-13 22:01:04

#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

int main() {
    int n; cin >> n;
    int h[n],mx=-1;
    for (int i=0;i<n;i++){
        cin >> h[i];
        mx = max(mx,h[i]);
    }

    for (int i=0;i<mx;i++){
        for (int k=0;k<n;k++){
            if (i<h[k]){
                for (int j=0;j<2*h[k];j++){
                    if (i==j) cout << '\\';
                    else if (j==2*(h[k])-i-1) cout << '/';
                    else cout << ' ';
                }
            }
            else {
                for (int j=0;j<2*h[k];j++){;
                    cout << ' ';
                }
            }
        }
        cout << '\n';
    }
    
    return 0;
}