Submission
Status:
PPPPP
Subtask/Task Score:
100/100
Score: 100
User: Patn01Z
Problemset: หินงอก
Language: cpp
Time: 0.004 second
Submitted On: 2026-10-07 20:42:26
#include <iostream>
using namespace std;
void hin(int i,int a){
if(i<a){
for(int j=0;j<i;j++){
cout << " ";
}
cout << "\\";
for(int j=0;j<2*(a-1-i);j++){
cout << " ";
}
cout << "/";
for(int j=0;j<i;j++){
cout << " ";
}
}
else{
for(int j=0;j<2*a;j++){
cout << " ";
}
}
}
int main(){
int N;
cin >> N;
int a[N];
cin >> a[0];
int max=a[0];
for(int i=1;i<N;i++){
cin >> a[i];
if(a[i]>max){
max=a[i];
}
}
for(int i=0;i<max;i++){
for(int j=0;j<N;j++){
hin(i,a[j]);
}
cout << endl;
}
return 0;
}