Submission

Score: 100

User: APNICHANAN

Problemset: หินงอก

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-10 09:45:55

#include <iostream>
using namespace std;
int main()
{
    int n ;
    cin >> n ;
    int h[n] , max = 0 ;
    for (int i = 0 ; i < n ; i++)
    {
        cin >> h[i] ;
        if (h[i] > max)
        max = h[i] ;
    }
    for (int i = 0 ; i < max ; i++)
    {
        for (int j = 0 ; j < n ; j++)
        {
            if (h[j] > i){
            for (int l = 0 ; l < i ; l++)
            cout << " " ;
            cout << "\\" ;
            for (int l = 0 ; l < 2 * (h[j] - 1 - i) ; l++)
            cout << " " ;
            cout << "/" ;
            for (int l = 0 ; l < i ; l++)
            cout << " " ;
            }
            else
            {
                for (int l = 0 ; l < (h[j] * 2) ; l++)
                    cout << " " ;
            }
        }
        cout << endl ;
    }
}