Submission

Score: 100

User: kinzap

Problemset: หินงอก

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-12 11:17:16

#include <iostream>
using namespace std;

int n,mx;

int main(){
    cin >> n;
    int m[n];
    for(int i= 0;i<n;i++){
        cin >> m[i];
        if(m[i] > mx)mx=m[i];
    }
    for(int i=0;i<mx;i++){
        for(int j = 0;j<n;j++){
            if(m[j] > i){
                for(int k = 0;k<i;k++){
                    cout<< " ";
                }
                cout << "\\";
                for(int k = 0;k<(m[j]-i)*2-2;k++){
                    cout<< " ";
                }
                cout<<"/";
                for(int k = 0;k<i;k++){
                    cout<< " ";
                }
            }
            else{
                for(int k = 0;k<m[j]*2;k++){
                    cout<< " ";
                }
            }
           
        }
         cout << endl;
    }
}