Submission

Score: 20

User: IKKIWPR

Problemset: หินงอก

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-14 07:30:50

#include <iostream>
using namespace std;

int main() {
    int n;
    cin >> n;
    int len[20];
    int maxL = 0;

    for (int k = 0; k < n; k++) {
        cin >> len[k];
        if (len[k] > maxL) maxL = len[k];
    }

    for (int r = 0; r < maxL; r++) {
        for (int k = 0; k < n; k++) {
            int L = len[k];
            int w = (L == 1) ? 2 : 2 * L - 1;

            for (int c = 0; c < w; c++) {
                if (r >= L)
                    cout << ' ';
                else if (c == r && c == w - 1 - r)
                    cout << 'V';
                else if (c == r)
                    cout << '\\';
                else if (c == w - 1 - r)
                    cout << '/';
                else
                    cout << ' ';
            }
        }
        cout << endl;
    }
    return 0;
}