Submission

Score: 100

User: Winzzwz

Problemset: B.Nai/SiraSira

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-06 10:56:45

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

int n,t[110],mxh;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> t[i];
        t[i] *= 2;
        mxh = max(mxh,t[i]);
    }
    for (int i = mxh; i >= 1; i--) {
        for (int j = 0; j < n; j++) {
            if (t[j] >= i) {
                cout << "####";
            } else {
                cout << "    ";
            }
            cout << "  ";
        }
        cout << "\n";
    }
    return 0;
}