Submission

Score: 100

User: Alif_Sama

Problemset: หินงอก

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-11 19:50:36

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

int main() {
    int n;
    cin >> n;
    int arr[n];
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }
    int max = arr[0];
    for (int i = 1; i < n; i++) {
        if (arr[i] > max) {
            max = arr[i];
        }
    }
    for (int i = 0; i < max; i++) {
        for (int j = 0; j < n; j++) {
            for (int k = 0; k < 2 * arr[j]; k++) {
                if (i < arr[j]) {
                    if (i == k) printf("\\");
                    else if ((arr[j] * 2  - (i+1)) == k) printf("/");
                    else printf(" ");
                } else printf(" ");
            }
        } printf("\n");
    }
}