Submission

[PPPPPPPPP]

Score: 100

User: njoop

Problemset: ภูเขา

Language: cpp

Time: 0.003 second

Submitted On: 2024-11-30 22:19:45

#include <bits/stdc++.h>

using namespace std;

char arr[100][10000];
int n, p=1, in, mx, sm;

int main() {
    cin >> n;
    for(int i=1; i<100; i++) {
        for(int j=1; j<10000; j++) {
            arr[i][j] = '.';
        }
    }
    while(n--) {
        cin >> in;
        sm += 2*in;
        mx = max(mx, in);
        for(int i=1; i<=in; i++) {
            arr[i][p] = '/';
            p++;
        }
        for(int i=1; i<=in; i++) {
            arr[in-i+1][p] = '\\';
            p++;
        }
    }
    for(int i=mx; i>=1; i--) {
        for(int j=1; j<=sm; j++) {
            cout << arr[i][j];
        }
        cout << "\n";
    }
    return 0;
}