Submission
Status:
PPPPP
Subtask/Task Score:
100/100
Score: 100
User: anonymous
Problemset: หินงอก
Language: cpp
Time: 0.006 second
Submitted On: 2026-10-06 16:34:18
#include <bits/stdc++.h>
using namespace std;
int a[8][2] = {0};
int main(){
int n,num[25],mx=0;cin >> n;
for(int i=0;i<n;i++)
{
cin >> num[i];
mx = max(mx , num[i]);
}
for(int i=0;i<mx;i++){
for(int k=0;k<n;k++){
for(int j = 0;j < num[k];j++)
{
if(i == j)cout << '\\';
else cout << ' ';
}
for(int j = 0;j < num[k];j++)
{
if(i + j == num[k] - 1)cout << '/';
else cout << ' ';
}
}
cout << "\n";
}
}