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