Submission

Score: 100

User: JRomsponCH

Problemset: หินงอก

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-01 14:24:17

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

int main() {
    int n;
    cin>>n;
    int arr[n];
    int mx = INT_MIN;
    for (int i = 0; i < n; i++) {
        mx = max(mx, arr[i]);
        cin>>arr[i];
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            for (int k = 0; k < arr[j]*2; k++) {
                if (arr[j] > i and (k == i)) {
                    cout<<"\\";
                }else if (arr[j] > i and ((k+i) == ((arr[j]*2)-1))){
                    cout<<"/";
                }else{
                    cout<<" ";
                }
            }
        }
        cout<<"\n";
    }
}