Submission
Status:
PPPPP
Subtask/Task Score:
100/100
Score: 100
User: por
Problemset: หินงอก
Language: cpp
Time: 0.002 second
Submitted On: 2025-10-12 10:45:05
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int maxl=0;
for(int i=0;i<n;i++){
cin>>arr[i];
if(maxl<arr[i]) maxl=arr[i];
}
for(int i=0;i<maxl;i++){
for(int k=0;k<n;k++){
for(int j=0;j<2*arr[k];j++){
if(i==j&&i<arr[k]){
cout<<"\\";
}
else if(i+j==2*arr[k]-1&&i<arr[k]){
cout<<"/";
}
else{
cout<<" ";
}
}
}
cout<<"\n";
}
return 0;
}