Submission

Score: 100

User: sakuragichan

Problemset: หินงอก

Language: cpp

Time: 0.002 second

Submitted On: 2026-09-05 10:55:37

#include <iostream>
#include <vector>
using namespace std;


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n ,x , maxn = 0;
    vector<int> v;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> x;
        v.push_back(x);
        if (x > maxn) {
            maxn = x;
        }
    }
    for (int i = 0; i < maxn; i++) {
        for (int j = 0; j < n; j++) {
            if ((v[j]-i) > 0) {
                cout << string(i, ' ') << "\\" << string(2*(v[j]-i) -2, ' ') << "/" << string(i, ' ');    
            }
            else if ((v[j]-i) <= 0) {
                cout << string(v[j]*2, ' ');
            }
        }
        cout << "\n";
    }
    return 0;
}