Submission

Score: 100

User: pupu

Problemset: หินงอก

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-05 19:08:12

#include <iostream>
#include <stack>
#include <queue>
using namespace std;

int main(){ios::sync_with_stdio(0); cin.tie(0);
	int n,mac=0;
	cin>>n;
	int x[n];
	for(int i=0;i<n;i++){
		cin>>x[i];
		if(x[i]>mac){
			mac = x[i];
		}
	}
	for(int i=0;i<mac;i++){
		for(int k=0;k<n;k++){
			for(int j=0;j<(x[k]*2);j++){
				if(i==j&&i<x[k]){
					cout<<"\\";
				}
				else if(i+j==(x[k]*2)-1&&i<x[k]){
					cout<<"/";
				}
				else{
					cout<<" ";
				}
			}
		}
		cout<<"\n";
	}
}