Submission
Status:
PPPPP
Subtask/Task Score:
100/100
Score: 100
User: Quaoar
Problemset: หินงอก
Language: cpp
Time: 0.003 second
Submitted On: 2025-09-25 15:33:15
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int nums[20] = {};
int height = -1;
for (int i = 0; i < n; i++) {
cin >> nums[i];
height = max(height, nums[i]);
}
for (int row = 0; row < height; row++) {
for (int i = 0; i < n; i++) {
int h = nums[i];
int w = h * 2;
if (row < h) {
for (int j = 0; j < w; j++) {
if (j == row) {
cout << "\\";
} else if (j == w - 1 - row) {
cout << "/";
} else {
cout << " ";
}
}
} else {
for (int j = 0; j < w; j++) {
cout << " ";
}
}
}
cout << endl;
}
return 0;
}