Submission

Score: 100

User: GONGGONG

Problemset: หินงอก

Language: cpp

Time: 0.002 second

Submitted On: 2026-10-04 02:09:17

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