Submission

Score: 100

User: winniecoder1029

Problemset: หินงอก

Language: cpp

Time: 0.004 second

Submitted On: 2026-09-07 21:35:26

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

int main(){
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    int n,hi = 0;
    cin >> n;
    int x[n];
    for(int i=0;i<n;i++){
        cin >> x[i];
        hi = max(hi,x[i]);
    }

    for(int i=0;i<hi;i++){
        for(int j=0;j<n;j++){
            if(i>=x[j]){
                for(int k=0;k<2*x[j];k++){
                    cout << " ";
                }
                continue;
            }
            for(int k=0;k<i;k++){
                cout << " ";
            }
            cout << "\\";
            for(int k=0;k<2*(x[j]-1-i);k++){
                cout << " ";
            }
            cout << "/";
            for(int k=0;k<i;k++){
                cout << " ";

            }
            //cout << "|";
        }
        cout << "\n";
    }
}