Submission

Status:

PPPPP

Subtask/Task Score:

100/100

Score: 100

User: patsa_v

Problemset: หินงอก

Language: cpp

Time: 0.003 second

Submitted On: 2026-10-05 16:27:55

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

int main(){
    int n;
    cin >> n;
    int arr[n];


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


    for(int i=0;i<mx;i++){
        for(int k=0;k<n;k++){
            for(int j=0;j<arr[k];j++){
                if(i==j){
                    cout << "\\";
                }else{
                    cout << " ";
                }
            }
            for(int j=0;j<arr[k];j++){
                if(i+j == arr[k]-1){
                    cout << "/";
                }else{
                    cout << " ";
                }
            }
        }
        cout << "\n";
    }
    


    return 0;
}