Submission
Status:
PPPPP
Subtask/Task Score:
100/100
Score: 100
User: FakeAnutin
Problemset: หินงอก
Language: cpp
Time: 0.004 second
Submitted On: 2026-09-29 15:51:34
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
int arr[n+5];
int max=0;
for(int i=1;i<=n;i++){
cin>>arr[i];
if(arr[i] > max){
max = arr[i];
}
}
for(int i=1;i<=max;i++){
for(int j=1;j<=n;j++){
for(int s=1;s<=arr[j]*2;s++){
if(i <= arr[j] && s==1+i-1){
cout<<"\\";
}else if(i <= arr[j] && s==arr[j]*2-i+1){
cout<<"/";
}else{
cout<<" ";
}
}
}
cout<<"\n";
}
}