Submission

Score: 100

User: Phi

Problemset: หินงอก

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-13 20:05:36

#include <bits/stdc++.h>
int main(){
    
    int numdr,max=0,s=0,e=0;
    std::cin>>numdr;
    int stn[numdr];
    for (int i=0;i<numdr;i++){std::cin>>stn[i];if (stn[i]>max) max=stn[i];}
    for (int i=0;i<max;i++){
        
        for (int j=0;j<numdr;j++){
            
            e=2*stn[j];
            if (i<e/2){
                for (int k=0;k<s;k++) std::cout<<" ";
                std::cout<<"\\";
                for (int k=0;k<e-s-i-2;k++) {std::cout<<" ";}
                std::cout<<"/";
                for (int k=e-s;k<e;k++) std::cout<<" ";
                
                
            }
            else for (int k=0;k<e;k++)std::cout<<" ";
        }
        std::cout<<'\n';
        s++;
    }
}