Submission

Score: 100

User: MaYangPhanTe

Problemset: หินงอก

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-20 09:21:33

#include <bits/stdc++.h>
using namespace std;

void dripstone() {
    int n;
    cin >> n;
    vector<int> l;
    int input;
    int max = 0;

    for (int i = 0; i < n; i++) {
        cin >> input;
        if(input > max) max = input;
        l.push_back(input);
    }

    for (int i = 0; i < max; i++) {
        
        for (int k = 0; k < n; k++) {

            for (int j = 0; j < 2*l[k]; j++){
                
                if(j < l[k] && i == j) cout << "\\";
                else if( j >= l[k] && i+j == 2*l[k]-1) cout << "/";
                else cout << " ";
            }
        }
        cout << "\n";
    }
}

int main() {
    dripstone();
}