Submission
Status:
PPPPP
Subtask/Task Score:
100/100
Score: 100
User: Weathery
Problemset: หินงอก
Language: cpp
Time: 0.004 second
Submitted On: 2026-10-12 10:58:49
#include <iostream>
using namespace std;
int main() {
int n,i,j,k; cin>>n;
int s[n],h=0;
for (i=0;i<n;i++) {
cin>>s[i];
h=max(h,s[i]);
}
for (i=0;i<h;i++) {
for (k=0;k<n;k++) {
for (j=0;j<s[k]*2;j++) {
if (i<s[k]) {
if (i-j==0) cout <<'\\';
else if (i+j==s[k]*2-1) cout<<'/';
else cout <<' ';
} else cout<<' ';
}
}
cout <<endl;
}
return 0;
}