Submission

[PPPPPPPPP]

Score: 100

User: Newtonabc

Problemset: ภูเขา

Language: cpp

Time: 0.002 second

Submitted On: 2024-09-27 13:38:04

#include<bits/stdc++.h>
using namespace std;
int arr[30];
char tb[30][500];
int main(){
	int n,mx=-1;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>arr[i];
		mx=max(mx,arr[i]);
	}
	for(int i=mx;i>=1;i--){
		for(int j=1;j<=n;j++){
			if(i>arr[j]) for(int k=0;k<arr[j];k++) cout<<".";
			else for(int k=0;k<i-1;k++) cout<<".";
			if(i<=arr[j]) cout<<"/";
			for(int k=0;k<(arr[j]-i)*2;k++) cout<<".";
			if(i<=arr[j]) cout<<"\\";
			if(i>arr[j]) for(int k=0;k<arr[j];k++) cout<<".";
			else for(int k=0;k<i-1;k++) cout<<".";
		}
		cout<<"\n";
	}
	
	
}