Submission

Score: 100

User: Jajxr_

Problemset: หินงอก

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-12 20:43:00

#include<iostream>
#include<vector>
using namespace std;
int main(){
	int n;
	cin>>n;
	int mostl=0,ori[n];
	for(int i=0;i<n;i++) cin>>ori[i];
	vector<int> l;
	for(int i=0;i<n;i++) l.push_back(ori[i]);
	for(int i=0;i<n;i++){
		if(mostl<ori[i]) mostl=ori[i];
	}
	for(int i=0;i<mostl;i++){
		for(int j=0;j<n;j++){
			if(l[j] == 0){
				for(int k=0;k<ori[j]*2;k++) cout<<" ";
				continue;
			}
			else{
				for(int k=0;k<ori[j]-l[j];k++) cout<<" ";
				cout<<"\\";
				for(int k=0;k<(l[j]-1)*2;k++) cout<<" ";
				cout<<"/";
				for(int k=0;k<ori[j]-l[j];k++) cout<<" ";
			}
			l[j]-=1;
		}
		cout<<"\n";
	}
}